Patent US4801469A successfully refreshed from Google Patents.
Patent US4866445A successfully refreshed from Google Patents.
US4866445A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and programmable device for transcoding character strings
Assignee: Individual
•
Filing: 1987-12-23
•
Granted: 1989-09-12
•
Expires: 2007-12-23
Abstract
Abstract Programmable transcoding device which sequences of binary words of variable lengths corresponding to strings of characters in a first alphabet are transcoded into other sequences of binary words intelligible in a second alphabet. The device is connected to digital systems exchanging sequences of words via interfaces provided with files. A CPU connected to the interfaces via a switching device receives the incoming sequences, and delivers transcoded outgoing sequences of binary words. An exchange management unit monitors the data transfers in the device and regulates the flows of words between the device and the digital systems. A terminal or microcomputer can also equip the device so as to produce transcoding tables to be downloaded in an RAM of the CPU.
Inventors
- 👤 Robert Valero
- 👤 Jean-Pierre Mounier
- 👤 Yves Berruyer
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 20:52
CPC Classifications
H; H03; H03M; H03M7/00
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
320 words
A method for transcoding incoming word messages having different lengths into transcoded outgoing word messages having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than or equal to 1 and representing the length of said incoming message , and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of transcoded outgoing message, each incoming binary word of an incoming message being used to address in a corresponding transcoding table associated to a rank n of said incoming binary word in said incoming message, where n is an integer between 1 and N, a transcoding word comprising a first field and a second field, in said transcoding table associated to said rank equal to 1, said first field being an indicator identifying said second field as being a transcoded outgoing message having a length M equal to 1 and corresponding to an incoming message having a length equal to 1, or as being an address in a table of transcoded outgoing messages relative to a transcoded outgoing message having a length M different from 1 and corresponding to an incoming message having a length N equal to 1, or as being an address of said transcoding table associated to said rank n equal to 2, in said transcoding tables associated respectively to ranks n different from 1, said first field being an indicator identifying said second field as being an address in said table of transcoded outgoing messages relative to a transcoded outgoing message corresponding to an incoming message having a length N greater than 1, or as being an address of said transcoding table associated to rank n+1, or as being a failure code when said incoming message is not to be transcoded.
Claim 2
Independent Claim
320 words
A method for transcoding incoming word messages having different lengths into transcoded outgoing word messages having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than or equal to 1 and representing the length of said incoming message , and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of transcoded outgoing message, each incoming binary word of an incoming message being used to address in a corresponding transcoding table associated to a rank n of said incoming binary word in said incoming message, where n is an integer between 1 and N, a transcoding word comprising a first field and a second field, in said transcoding table associated to said rank equal to 1, said first field being an indicator identifying said second field as being a transcoded outgoing message having a length M equal to 1 and corresponding to an incoming message having a length equal to 1, or as being an address in a table of transcoded outgoing messages relative to a transcoded outgoing message having a length M different from 1 and corresponding to an incoming message having a length N equal to 1, or as being an address of said transcoding table associated to said rank n equal to 2, in said transcoding tables associated respectively to ranks n different from 1, said first field being an indicator identifying said second field as being an address in said table of transcoded outgoing messages relative to a transcoded outgoing message corresponding to an incoming message having a length N greater than 1, or as being an address of said transcoding table associated to rank n+1, or as being a failure code when said incoming message is not to be transcoded.
Claim 3
Dependent Claim
40 words
The method as claimed in claim 1, wherein said table of transcoded outgoing message is divided into as many transcoded outgoing message tables as there are transcoding tables, said transcoded outgoing message tables being respectively associated to said transcoding tables.
Claim 4
Independent Claim
36 words
A method as claimed in claim for incoming binary words comprising a determined integer number of bits B, said transcoding tables comprising at the most 2 B-1 binary transcoding words each with at least B+1 bits.
Claim 5
Dependent Claim
270 words
A programmable device for transcoding incoming messages having different lengths into transcoded outgoing word message having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than or equal to 1 and representing the length of said incoming message, and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of said transcoded outgoing message, said device comprising: first and second interfacing means for connecting said device respectively to first and second incompatible digital systems having to communicate together, via links through which said incoming messages and transcoded outgoing messages transit; processing means comprising transcoded tables and a programmed algorithm for identifying said incoming messages thereby delivering said transcoded outgoing messages corresponding to said incoming messages; switching means for connecting alternately said first and second interfacing means to said processing means whereby said processing means receives said incoming messages from said interfacing means and transmits in response to said corresponding transcoded outgoing messages to said interfacing means; exchange management means for managing said interfacing means and said switching means in terms of a control binary word delivered from said processing means thereby regulating the rate of messages exchanged between said device and said systems in terms of data supplied by said interfacing means; and means for initializing said processing means during a phase prior to transcoding, by loading transcoding tables in a RAM memory included in said processing means, said initializing means displaying data during transcoding.
Claim 6
Dependent Claim
270 words
A programmable device for transcoding incoming messages having different lengths into transcoded outgoing word message having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than or equal to 1 and representing the length of said incoming message, and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of said transcoded outgoing message, said device comprising: first and second interfacing means for connecting said device respectively to first and second incompatible digital systems having to communicate together, via links through which said incoming messages and transcoded outgoing messages transit; processing means comprising transcoded tables and a programmed algorithm for identifying said incoming messages thereby delivering said transcoded outgoing messages corresponding to said incoming messages; switching means for connecting alternately said first and second interfacing means to said processing means whereby said processing means receives said incoming messages from said interfacing means and transmits in response to said corresponding transcoded outgoing messages to said interfacing means; exchange management means for managing said interfacing means and said switching means in terms of a control binary word delivered from said processing means thereby regulating the rate of messages exchanged between said device and said systems in terms of data supplied by said interfacing means; and means for initializing said processing means during a phase prior to transcoding, by loading transcoding tables in a RAM memory included in said processing means, said initializing means displaying data during transcoding.
Claim 7
Dependent Claim
276 words
A programmable device for transcoding incoming messages having different lengths into transcoded outgoing word messages having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than of equal to 1 and representing the length of said incoming message, and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of said transcoded outgoing message, said device comprising: first and second interfacing means for connecting said device respectively to first and second incompatible digital systems having to communicate together, via links through which said incoming messages and transcoded outgoing messages transit; processing means comprising transcoding tables and a programmed algorithm for identifying said incoming messages thereby delivering said transcoded outgoing messages corresponding to said incoming messages; switching means for connecting alternately said first and second interfacing means to said processing means whereby said processing means receives said incoming messages from said interfacing means and transmits in response to said corresponding transcoded outgoing message to said interfacing means; exchange management means for managing said interfacing means and said switching means in terms of a control binary word delivered from said processing means thereby regulating the rate of messages exchanged between said device and said systems in terms of data supplied by said interfacing means; and means for initializing said processing means during a phase prior to transcoding, by loading transcoding tables in a RAM memory comprised in said processing means, said initializing means including a microcomputer, terminal, or hexadecimal keyboard comprising display units.
Claim 8
Dependent Claim
276 words
A programmable device for transcoding incoming messages having different lengths into transcoded outgoing word messages having different lengths, at least some of the incoming messages being composed of N ordered incoming binary words, N being a variable integer greater than of equal to 1 and representing the length of said incoming message, and at least some of the transcoded outgoing messages being composed of M ordered outgoing binary words, M being a variable integer greater than or equal to 0 and representing the length of said transcoded outgoing message, said device comprising: first and second interfacing means for connecting said device respectively to first and second incompatible digital systems having to communicate together, via links through which said incoming messages and transcoded outgoing messages transit; processing means comprising transcoding tables and a programmed algorithm for identifying said incoming messages thereby delivering said transcoded outgoing messages corresponding to said incoming messages; switching means for connecting alternately said first and second interfacing means to said processing means whereby said processing means receives said incoming messages from said interfacing means and transmits in response to said corresponding transcoded outgoing message to said interfacing means; exchange management means for managing said interfacing means and said switching means in terms of a control binary word delivered from said processing means thereby regulating the rate of messages exchanged between said device and said systems in terms of data supplied by said interfacing means; and means for initializing said processing means during a phase prior to transcoding, by loading transcoding tables in a RAM memory comprised in said processing means, said initializing means including a microcomputer, terminal, or hexadecimal keyboard comprising display units.
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-09-11 | 1993-03-13 | 1993-09-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-11 | 1997-03-13 | 1997-09-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-11 | 2001-03-13 | 2001-09-12 | $7700.00 | Window Closed / Lapsed |