EP1074110A1 - Procede de transmission, de reception et/ou de stockage d'informations - Google Patents

Procede de transmission, de reception et/ou de stockage d'informations

Info

Publication number
EP1074110A1
EP1074110A1 EP99914740A EP99914740A EP1074110A1 EP 1074110 A1 EP1074110 A1 EP 1074110A1 EP 99914740 A EP99914740 A EP 99914740A EP 99914740 A EP99914740 A EP 99914740A EP 1074110 A1 EP1074110 A1 EP 1074110A1
Authority
EP
European Patent Office
Prior art keywords
file
array
coded
predetermined
arrays
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP99914740A
Other languages
German (de)
English (en)
Inventor
Gad Naaman
Andrey Vorboyoff
Mendi Tassa
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Intacta Labs Ltd
Original Assignee
Intacta Labs Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Intacta Labs Ltd filed Critical Intacta Labs Ltd
Publication of EP1074110A1 publication Critical patent/EP1074110A1/fr
Withdrawn legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0064—Concatenated codes
    • H04L1/0065—Serial concatenated codes
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0071—Use of interleaving
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32609—Fault detection or counter-measures, e.g. original mis-positioned, shortage of paper
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32609—Fault detection or counter-measures, e.g. original mis-positioned, shortage of paper
    • H04N1/32625—Fault detection
    • H04N1/32641—Fault detection of transmission or transmitted data, e.g. interruption or wrong number of pages
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
    • H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
    • H04N1/32609—Fault detection or counter-measures, e.g. original mis-positioned, shortage of paper
    • H04N1/32646—Counter-measures
    • H04N1/32683—Preventive counter-measures, e.g. using redundant hardware, or anticipating a fault
    • H04N1/32689—Involving the use of error correction codes

Definitions

  • This invention relates to a method for the processing of information, particularly for the transmission and receipt of binary information by information media such as facsimile and/or video-television means, including the storage of information on. and retrieval thereof from, printed matter or electronic storage means such as magnetic tape and laser discs, and in particular the correction of errors or uncertainties and for the reconstruction of parts missing and distortions introduced by the transmission channel such as in printing, reading or transmission.
  • a transmission channel is herein defined as any suitable channel which may be used for the transmission, and/or for the storage of information, including any suitable information medium such as a cable, a radio channel, a microwave channel or a digital integrated circuit or a storage disc, or printed matter.
  • the source data may be missing or may be so distorted at times as to render most if not all . of the read data unrecognisable.
  • the number of source bits that when taken together are attributed a definite meaning is small, for example a byte representing an ASCII character, then the source data will be more sensitive to noise than in the case, for example, of a normal fax transmission wherein a relatively much larger number of bits represent the graphical image of a letter or number.
  • Error correcting codes are described in "An Introduction to Error Correcting Codes with Applications” by Scott A. Vanstone and Paul C. van Oorschot. 1989, and can be used in some instances to detect and correct channel errors.
  • redundancy is introduced into each message element of the source data, and in general, the greater the redundancy incorporated into each message element with respect to the length thereof, the more reliably that the received data may be correspondingly decoded to correct for any channel errors therein.
  • introducing redundancy necessarily increases the size of the source data, and may thus be economically undesirable, as in the case of facsimile transmissions, for example.
  • the compression of the data prior to the addition of an error correcting code redundancy, as herein described, provides some relief to this problem.
  • European Patent Application No. 93118357.8 describes a process for the transmission of information defined in digital form, which comprises transforming a clear file containing said information into a graphical equivalent form, transmitting said form and bringing it back to digital form.
  • a number such as 2 or 3, of correspondence rules are applied to each byte of the clear file, whereby to obtain a coded file in which each character is represented by a coded byte comprising a number, e.g., 3 or 4, of different bytes.
  • the coded file is then transmitted and subsequently received in a form wherein each of the coded bytes is represented by a suitable grid. It is then determined, by referring to the aforesaid correspondence rales, whether 3
  • Bursts errors occur when a number adjacent bits of the source data comprise channel errors. Thus, if a large number of burst errors occurs in any one cluster, the data originally carried by the corresponding portion of the source file will be lost, and the method disclosed in the aforesaid EPA is unable to reconstruct the lost information.
  • Source data that is transmitted through a channel as hereinbefore described may comprise channel errors in the form of noise and distortion. If errors are introduced at the beginning of a transmission so that all the transmitted bits are merely linearly shifted with the first few bytes of the received data comprising error bits, then the whole of the received transmission will be linearh 4
  • the received transmission may be resynchronised so that the appropriate error correction method may be applied to the actual source data and the whole transmission may thus be effectively recognised.
  • the read data will be effectively desynchronised in a non-linear manner.
  • ECC's cannot effectively correct the data unless the same is resynchronised, and since it is not normally possible to determine exactly the form and extent of the distortion, the source data would be effectively irrecoverable.
  • the aforementioned EPA discloses a method for transmitting data wherein the size of the original data file is substantially increased in order to enable recovery of some of the transmitted data.
  • at least a quadrupling in the size of the data file is required, leading to a low densities in terms of the transmitted data.
  • the aforementioned EPA discloses the use of black- and vvhite- coloured cells to represent the digital values. 0's and l * s. of a computer data file which it is desired to print (the graphic-equivalent form), and possibly then to fax the same via a facsimile machine.
  • the aforesaid EPA does not disclose nor suggest the use of multicolours in conjunction with the data transmission and/or retrieving method.
  • Channel means such as TN/video media and video/CD media have very large potentials in terms of the volume and speed with which information may be transmitted and/or stored, and further, the very wide applicability of these media offers great advantages and flexibility in the transmission and/or storage of information. However, channel errors occurring via these channels need to be reliably overcome in order for information transmitted and/or stored via these channels to be retrieved successfully.
  • An aim of the present invention is to provide a process for transmitting source data while enabling the same to be recovered in the event that burst errors up to a predetermined level occur during transmission.
  • a further aim of the present application is to provide a process for synchronising transmitted data comprising channel errors, particularly distortion; received data thus synchronised may then be operated on by a host of error correcting codes, wherein each may be created to overcome a particular form of channel error, thereby significantly increasing the reliability ofthe information medium comprising said channel.
  • a further aim of the present invention is to provide a process which permits a radical increase in the density of the information and, of course, in the amount of information which may be transformed and printed onto a grid form of a given size.
  • a further aim of the present invention is to provide a process which permits to transform and print information into grid form comprising coloured cells and reconstruct it from said form while recovering parts of it which have become lost or unreadable because of failures in printing or reading the print or damages to said print.
  • a further aim of the present invention is to provide a process which permits to transform and print information into grid form having cells each comprising one of a predetermined number, greater than 2, of different colours, and to reconstruct it from said form, wherein to increase the information density per unit coloured cell ofthe grid.
  • a further aim of the present invention is to provide a process which permits to transform and print information into grid form having cells each comprising one of a predetermined number, greater than 2, of different colours, and to reconstruct it from said form, while recovering parts of it which have become lost or unreadable because of failures in printing or reading the print or damages to said print. 6
  • a further aim of the present invention is to provide a process which successfolly overcomes the problems due to noise in fax transmission.
  • a further aim of the present invention is to provide a process which permits to reconstruct parts of a fax message which have become lost or unreadable because of transmission failures or damages to graphic representations of the message.
  • a further aim of the present invention is to provide a process which permits to achieve the aforesaid purposes together with a high compression of the fax message.
  • a further aim of the present invention is to provide a process which permits to increase the speed ofthe transmission of a fax message.
  • a further aim of the present invention is to provide a process for efficiently transmitting data, in particular large volumes thereof, via television/Video channel means while successfully converting binary data to various sets of TV/Video protocols overcoming distortion and noise problems associated therewith.
  • a further aim of the present invention is to provide a process which permits to achieve the aforesaid aims in an easy and user-friendly way.
  • the present invention relates to a process for transmitting information comprising the steps of:- a) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; b) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file arra ⁇ in the 7
  • said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array;
  • steps (I) and (II) are sequentially repeated up to a predetermined reading limit, each time the said predetermined 5 reading procedure in (I) providing a different regenerated estimated read array for decoding in (II), wherein:
  • said third decoding procedure enables said regenerated estimated read array to io be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted
  • Figure 1 illustrates an ideal logical zone and typical logical zone comprising channel errors of a received file at an enlarged scale.
  • Figure 2 illustrates a number of consecutive logical zones and adjusted logical zones of a received file at an enlarged scale.
  • Figure 3 illustrates an example of a numbering system applied to the pixels in and around each cell of a typical logical zone.
  • Figure 4 illustrates the colour cells representing a received fourth coded file array and the digital values corresponding to thereto.
  • Figure 5 illustrates an example of a decision tree used in a typical compression process. 11
  • the present invention relates to a process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ⁇ ) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a second coded data file comprising second coded file arrays by applying a predetermined reversible second coding procedure to said first coded data file arrays, wherein adjacent bits constituting each said first coded file array are rearranged to be dispersed one from another within said second coded data file: iv) transmit
  • information that is desired to be transmitted via a suitable channel is embodied in a first computer file comprising a number of bits, and arranged in XI consecutive first file arrays each comprising a predetermined number, NI, of bits. If the number of bits comprising said first computer file is not exactly divisible by XI, then arbitrary bits having known digital values may be added to the final first file array, for example, to complete its NI bits. Conveniently, NI may be 8, and thus the said first file arrays are bytes. Of course, the value of 8 is not limiting for NI, which may be greater or smaller than 8, as desired.
  • the said first file arrays may be each be arrays of bits comprising digital values to which a definite meaning is attributed when the digital values are taken together.
  • some or all ofthe first file arrays may be ASCII symbols.
  • some or all of the first file arrays may comprise arrays of bits defining the position and colour of a pixel.
  • the said first file arrays may comprise bits whose digital values represent the intensity value of a corresponding portion of a graphical image.
  • the character "A” may be embodied in a computer file as a relatively large array of bits having digital values corresponding to the intensity of pixels comprising the geometrical image ofthe said character "A".
  • the information that is desired to be transmitted and/or stored is compressed by suitable compression means prior to embodying in said first computer file, as hereinafter described.
  • a first coded data file corresponding to said first data file is generated by applying a predetermined reversible first coding procedure to said first computer file.
  • Said first coded file is comprised of first coded file arrays, wherein each first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding group of bits of the said first computer file in the event that errors up to a predetermined first error level are introduced into said first coded group of bits.
  • the said first computer file is arranged as hereinbefore described in a number, XL of consecutive first file arrays, each comprising NI bits, and an appropriate reversible first coding procedure is applied, wherein to generate a first coded file preferably also comprising XI consecutive arrays, each comprising a number, SI, of bits.
  • Said first coding procedure is characterised in being reversible, i.e., a message word (i.e.
  • a first file array that yields a particular code word (i.e., a first coded file array) by application of said first coding procedure may itself be derived from this code word by said first coding procedure in reverse, and further, this result may still be achieved even if errors up to a predetermined first error level are present in the said code word.
  • Said first coding procedure comprises, in the preferred embodiment, a suitable error correcting code (ECC), chosen so as to provide adequate error correction, given a certain error level expected through a given transmission channel.
  • ECC error correcting code
  • ECC Error Correction Codes
  • NI 85 and SI is 128, or, NI is 99 and SI is 128. In these cases, up to 5 and 4 errors, respectively, may be corrected using Reed Solomon or BCH ECC's.
  • a second coded data file is generated by applying a predetermined reversible second coding procedure to said first coded data file.
  • Said second coded file is comprised of second coded file arrays, wherein each said second coded file array is characterised in that adjacent bits constituting each said first coded array are rearranged to be dispersed one from another within said second coded data file.
  • the first coded file need not generally be transformed into the said second coded file, but is instead transmitted or stored in the form of a fourth coded file, as hereinafter described.
  • the first coded file can be transformed directly into the said third coded file prior to transmission and/or storage, if synchronisation ofthe data is also required at the receiving/retrieval end. as hereinafter described.
  • Said second coding procedure is also characterised in being reversible so that when applied in reverse to said second coded file, the said second coding procedure generates the corresponding first coded file from the said second coded file.
  • said second coding procedure comprises an interleaving procedure, which in one form, operates on D groups of D bits at a time.
  • the first D groups of D bits comprising the first coded file is rearranged to become the first D groups of D bits of the second coded file.
  • the groups of the said first coded file becomes the 1st bit of the 1st group of bits of said D groups of the said second coded file.
  • the 2nd bit of the 1st group of bits of said D groups ofthe said first coded file becomes the 1st bit of the 2nd group of bits of said D groups of the said second coded file.
  • the 3rd bit ofthe 1st group of bits of said D groups of the said first coded file becomes the 1st bit ofthe 3rd group of bits of said D groups ofthe said second coded file. And so on until the Dth bit of the 1st group of bits of said D groups of the said first coded file becomes the 1st bit of the Dth group of bits of said D groups of the said second coded file.
  • the 1st bit of the 2nd group of bits of said D groups of the said first coded file becomes the 2nd bit of the 1st group of bits of said D groups of the said second coded file.
  • all the bits comprising the 2nd group of bits of said D groups of the said first coded file are rearranged into the 2nd-bit position in each consecutive group of the D groups of the said second coded file.
  • all the bits comprising the Dth group of bits of said D groups of the said first coded file are rearranged into the Dth-bit position in each consecutive group of the D groups of the said second coded file.
  • the rearranging procedure then rearranges the next D groups of D bits in said first coded file to D different groups of D bits of the second coded file. And so on, until all the bits comprised in said first coded file are rearranged to generate the said second coded file.
  • D can be chosen to suit the particular application and may be equal to S 1 or different.
  • the optimal value of D is strongly dependent on the type of error associated with the transmission channel, in particular the receiving or retrieval apparatus. For example, a receiving facsimile machine is more prone to introducing channel errors in the form of missing lines, while a the use of a scanner on printed matter may result in some pixels being lost.
  • D may be 32 for a typical printing transmission channel, but may also be chosen to be greater or smaller.
  • a suitable number of bits having known digital values may be added to the bits that are left over in the said first coded file after the last D grou ⁇ s of D 16
  • bits have been rearranged, in order to create D foil groups of D bits in each.
  • interleaving procedure is preferably matched to the expected level and distribution of burst errors in any given transmission channel.
  • said second coding procedure may also be embodied in a software routine, or in a table or even in a simple verbally defined formula.
  • the second coded file may then be transformed into a suitable fourth coded file comprising fourth coded file arrays, as hereinafter described, and then stored and/or transmitted via any suitable channel, as hereinafter described.
  • the second coded file is directly transformed to said fourth coded file when it is desired to transmit same via a transmission channel such as from fax modem to fax modem, wherein distortion errors requiring synchronisation at the receiving/retrieval end are not usually introduced.
  • the transmission channel comprises e.g. a facsimile machine or printing on a material substrate, wherein distortion errors requiring synchronisation at the receiving/retrieval end are usually expected to be introduced
  • the said second coded file is transformed into a third coded file as hereinafter described, and the third coded file is subsequently transformed into a suitable fourth coded file which is then transmitted and/or stored via the said transmission channel.
  • the present invention also relates to a process for transmitting and/or storing information comprising the steps (i) to (iv) as hereinbefore described. corresponding to encoding said information according to said first and second coding procedures and transmitting said second coded file or said fourth coded file generated from said second coded file, wherein prior to transmitting and/or storing said second coded file or said fourth coded file, said process further comprises regenerating second coded file arrays by applying a predetermined 17
  • the present invention also relates to a process for transmitting and/or storing information comprising the steps of:- i) embodying said information in a first computer file comprising a number of bits, wherein said bits are arranged in consecutive first computer file arrays each comprising a predetermined number of bits each; ii) generating a first coded data file comprising first file coded arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array; iii) generating a third coded data file comprising third coded file arrays by applying a predetermined reversible third coding procedure to said first coded file, wherein said third coding procedure enables each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error level are subsequently
  • the information to be stored and/or transmitted is embodied into a first computer file which is then transformed into a third data file. It is preferable, however, to first transform the first computer file into the said first coded file, and then transform same into said third coded file directly in a similar manner to the generation of a third coded file from said second coded file, as hereinafter described, mutatis mutandis.
  • the first coding procedure, together with the first decoding procedure are preferably used for the correction of substantially single random errors, while the third coding procedure together with the third decoding procedure may be used only for synchronising the data.
  • the generation of a third coded file from said first computer file or from said first coded file is similar to the generation of a third coded file from said second coded file, as hereinafter described, mutatis mutandis.
  • the said information is coded according to said first and said second coding procedures to generate a second coded file, which is then transformed into a third coded file, as hereinafter described.
  • a third coded file (or said "regenerated second coded file' " ) is generated by applying a predetermined reversible third coding procedure to said second coded file, in the preferred embodiment, or to the said first code file in other embodiments.
  • Said third coded file comprises third coded file arrays, wherein each said third coded file array is characterised in comprising a suitable error correcting code for enabling each third coded array to be recognised as a legitimate array in the event that errors up to a predetermined second error 19
  • a characterising feature of the said third coding procedure is that it is reversible, so that when applied in reverse to said third coded file, the said third coding procedure generates the corresponding second coded file from the said third coded file.
  • the said third coding procedure may be similar to said first coding procedure, as hereinbefore described.
  • the said third coding procedure comprises establishing a known relationship between pairs of groups of bits comprising said second coded file, according to a correspondence rule.
  • the bits comprising said second coded file are first arranged into groups of 24 bits, or 3 bytes of 8 bits each.
  • the first and second bytes are chosen, and the XOR rule is applied to them to generate a fourth byte.
  • each of the bits of the resulting fourth byte is identical to the corresponding bit in the first byte, or has the opposite digital value to it, depending on whether the value of the corresponding bit of the second byte is 0 or 1. respectively.
  • the XOR rule is applied to the second and third bytes to generate a fifth byte.
  • the fourth and fifth bytes are then added to the corresponding group of 24 bits.
  • the fourth byte is intercalated between the first and second bytes
  • the fifth byte is intercalated between the second and third bytes.
  • the said group of 24 bits of the second coded file comprises the following three consecutive bytes :-
  • the corresponding group of bits ofthe third coded file comprises :-
  • the second coded file may be arranged in groups of 16 bits, or 2 bytes :- 00100000
  • the redundancy for synchronisation and error correction that is incorporated into the data only comprises 50% or less of the size of the said second coded file, which is substantially less than with the prior art methods, as hereinbefore described.
  • the said third coded file is then preferably transformed into a suitable fourth coded file which is then transmitted and/or stored via a suitable transmission channel, as hereinafter described. Nonetheless, for some channels, e.g. fax modem to fax modem, said third coded file may transmitted directly without the need for generating a fourth coded file prior to transmission.
  • the present invention also relates to a process for transmitting and/or storing information, as hereinbefore described, wherein said process further comprises generating said fourth coded file from said second coded file or said third coded file or said regenerated second coded file, and transmitting and/or storing said fourth coded file, wherein said fourth coded file is generated from said second coded file or said third coded file or said regenerated second code file, respectively, by rearranging the bits constituting said second coded file or said third coded file or said regenerated second coded file, respectively, into fourth coded file arrays, each said fourth coded file array comprising a predetermined number. F, of bits.
  • Said fourth coded file may be printed on a suitable material backing, such as paper or plastic for example, and each said fourth coded file array may then be represented by a cell comprising a predetermined number of pixels associated thereto, said cell having one of 2 colours corresponding to the digital value of said fourth coded file array according to a predetermined colouring rule.
  • Said predetermined number F of bits may be one, and said cells are then either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in said fourth coded file is 1 or 0, respectively.
  • said first colour or said second colour is white and said second colour or first colour, respectively, is black.
  • said predetermined number F of bits may be two, and said cells may each be.
  • said predetermined number F of bits may be any integer, B, from 3 to 24. and said cells may each be, then, one of from 2 J to 2 , predetermined colours, respectively, according to the digital value of the corresponding said fourth coded file array.
  • the fourth coded file is generated from the said second coded file (or said third coded file or said "regenerated second coded file", depending on the coding procedures that were applied to the said first computer file), as 22
  • the fourth coded file is generated in a format suitable to the transmission channel via which the said fourth coded file is to be transmitted and/or stored, and thus enables the transmission and/or storage of the data to be effected in a more efficient manner.
  • the said second coded file ⁇ . or the said third coded file is transformed into a suitable fourth coded file as a bitmap or picture by applying suitable reversible conversion rules.
  • the fourth coded file is then rendered suitable for printing, storage or transmission equipment, by a corresponding transmission channel auxiliary means such as a printer driver, TV/Video converter, fax driver etc.
  • a corresponding transmission channel auxiliary means such as a printer driver, TV/Video converter, fax driver etc.
  • said channel auxiliary means can receive an input image and suitably convert the same to the desired protocol, while in other cases where the input is not of a standard image nature, the fourth coded file may be prepared, in a manner known in the art, suited to the particular transmission channel.
  • the generation of a fourth coded file from said second coded file or said "regenerated second coded file” is similar to the generation of a fourth coded file from a said third coded file hereinafter described, mutatis mutandis.
  • the third coded file which consists of 0's and Vs can be transformed into a grid of colour cells, comprising said fourth coded file, in which the bits constituting said third coded file are arranged into a suitable number of colour arrays each comprising a predetermined number, F, of bits.
  • the said fourth coded file may be printed on a suitable material backing and thus each said fourth coded file array is represented by a colour cell comprising a predetermined number PI of pixels associated thereto. Each colour cell has
  • F one of 2 colours corresponding to the digital value of said fourth coded file array according to a predetermined colouring rule.
  • F has the value of 1. and the said colour cells are either a first colour or a second colour according to whether the corresponding fourth coded file array comprised in the said third data file has a digital value of 1 or 0.
  • the said first colour and the said second colour are significantly distinguishable one from the other, and may thus be white and black, respectively, so that the 0's are represented by colour cells of white pixels and the l 's by colour cells of black pixels, though the reverse is also possible, as are different pairs of colours.
  • This is a very conventional procedure which can be carried out by means of any computer and printer. This transformation is actually carried out if the said third coded file is to be sent from a sending fax machine to a receiving fax machine. It will then be printed in grid form on a suitable substrate, as hereinafter described, and then sent by the sending fax machine.
  • each fourth coded file array may be 2, so that each said colour cell comprises one of four colours, according to whether the corresponding fourth coded file array comprised in the said fourth coded data file has a digital value of 00, 01, 10 or 11.
  • said four colours comprise a set of colours which are very distinguishable one from the other, e.g., red, green, blue and black, but may comprise other colours.
  • each pair of bits of the said third coded file may be represented by each colour cell ofthe printed fourth coded file.
  • the said fourth coded file may be generated by dividing the bits comprising said third coded file into fourth coded file arrays each comprising three bits.
  • each 3 bits comprising a fourth coded file array will represent one colour from a possible range provided by the printing and/or transmission means.
  • the fourth coded file arrays may then have the following RGB values :- Fourth coded file array Corresponding RGB Value digital value (R, G, B)
  • the said fourth coded file may be generated by dividing the bits comprising said third coded file into fourth coded file arrays each comprising four bits.
  • each 4 bits comprising a fourth coded file array will represent one colour from a possible range provided by the printing and/or transmission means.
  • the fourth coded file arrays may then have the following RGB values, for example:-
  • the predetermined number, F. of bits may be greater than 3 or 4, with the number of different colours possible for each colour cell being 2 colours.
  • F. of bits may be greater than 3 or 4, with the number of different colours possible for each colour cell being 2 colours.
  • a great advantage of arranging the said third coded cell into a fourth coded file comprising fourth coded file arrays, wherein F is greater than 1 is that the size ofthe printed data can be greatly reduced. For example, when F is 4. i.e.. sixteen different colour cells are possible, each colour cell of PI pixels contains 4 times more information than when F is set at 1.
  • the said fourth coded file may be much more dense than the said third coded file when printed and /or stored in a medium that permits more than 2 colours, such as a colour fax machine or via television- video storage and/or transmission means or printed via colour printer.
  • the said fourth coded file may be transformed into a corresponding grid of colour cells, in which each fourth coded file array of F bits is represented by a corresponding colour cell, which may comprise one or more pixels as desired.
  • a corresponding grid of colour cells in which each fourth coded file array of F bits is represented by a corresponding colour cell, which may comprise one or more pixels as desired.
  • This transformation is actually carried out if the said fourth coded file is to be sent from a sending facsimile machine to a receiving facsimile machine. It will then be printed on a suitable substrate in the form of the aforementioned colour cells and then transmitted by the sending facsimile machine.
  • a predetermined number, PI of pixels are printed to represent each colour cell, and PI will generally depend on the resolution of the printer and also of the scanner.
  • PI may be 9 pixels (i.e.. 3x3); with a 400 dpi printer and a 600 dpi scanner, PI may be 4 pixels (i.e.. 2x2); with a 400 dpi printer and a 200 dpi scanner. PI may be 36 pixels (i.e.. 6x6).
  • the said fourth coded file may be sent from fax modem to receiving fax machine.
  • the fourth coded file is transmitted in digital 26
  • a predetermined array of PI sub-bits may be associated with each bit ofthe said fourth coded file, where PI may be 4 or (2x2) sub-bits or pixels. It is also possible to transmit said first coded file, or said second coded file or said regenerated second coded file or said third coded file from fax modem to fax modem.
  • the said fourth coded file may be sent from fax modem to a fax modem, wherein an actual transformation into fourth coded file arrays is not necessary and the said fourth coded file will be handled at all stages as constituted by digital values.
  • a predetermined array of PI sub-bits may be associated with each bit of the said fourth coded file prior to transmission of same, wherein PI may be greater or equal to 1 or (lxl) sub-bits or pixels.
  • the fourth coded file may be transmitted via any suitable television/video means such as via a television cable channel, a television signal transmitter or via a satellite television channel.
  • the data comprised in said fourth coded file is converted into corresponding television/video signals and transmitted in a suitable manner known in the art.
  • the method for converting the said third coded file into the said fourth coded file is strongly dependent on the corresponding TN/Nideo format or protocol, as well as on the quality ofthe associated apparatus.
  • the said fourth coded file may be printed in the form of colour cells on a convenient print substrate, e.g., paper or plastic, and then stored or transported or handled in any convenient way, wherein each colour cell comprises predetermined array of PI pixels associated with each array of F bits of the said fourth coded file.
  • a convenient print substrate e.g., paper or plastic
  • each colour cell comprises predetermined array of PI pixels associated with each array of F bits of the said fourth coded file.
  • the print thus generated may be read by suitable electro-optical means, such as a scanner or a video camera for example, and the original message will be reconstructed by the same procedure that will now be described for reconstructing the transmitted 27
  • PI may be 9 or (3x3) pixels, or, if a 400 dpi printer and a 600 dpi scanner are used. PI may be 4 or (2x2) pixels.
  • the said fourth coded file may be stored on a digital storage medium, e.g., computer memory means, such as a computer hard disc or floppy discs, or CD ROM. wherein a predetermined array of PI (typically 1 or (lxl)) pixels may be associated with each bit ofthe said fourth coded file.
  • a digital storage medium e.g., computer memory means, such as a computer hard disc or floppy discs, or CD ROM.
  • PI typically 1 or (lxl)
  • the said fourth coded file may be stored on television/video storage means or other analog storage means, comprising e.g.. magnetic tape, video tape, or laser disc, wherein said fourth coded file is converted into corresponding television/video signals or other analog signals and stored in a suitable manner known in the art.
  • said analogue storage means require auxiliary equipment, such as a commercially available VCR, for example, used as an interface to store said fourth coded file onto video tape.
  • the present invention also relates to a process for receiving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, preferably as hereinbefore described, said process comprising the steps of :-
  • each said logical zone comprises an array of elements, wherein each element is defined by a received bit/pixel array comprising a predetermined number P2 of received bits/pixels;
  • said third decoding procedure enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded file array is generated corresponding to said estimated read array; or (ii) the said third decoding procedure is unable to recognise the said estimated read array as a legitimate array, wherein steps (a) and (b) are sequentially repeated up to a predetermined reading limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for 29
  • said third decoding procedure enables said regenerated estimated read array to be recognised as a legitimate array, wherein a legitimate third decoded file array corresponding thereto is generated and wherein said map of logical zones may be adjusted to provide an adjusted logical zone next to said logical zone, wherein at least one of the bits/pixels comprised in the said received bit/pixel array of at least one of the elements of said adjusted logical zone was previously comprised in a different logical zone or adjusted logical zone; or
  • the process of receiving and recovering data transmitted according to the process of the present invention comprises several steps.
  • the transmitted fourth coded file possibly including channel errors, is received by suitable means into a received data file of a suitable computer means, and the said received data file comprises a number of pixels or bits, usually 24 bits per pixel in depth.
  • the obtained image can be scanned by a scanner, for example, which delivers as output a true colour bitmap, i.e.. a computer-based representation of the image, wherein each pixel may consists of 24 bits of information relating to the colour, intensity, etc. of the pixel. If original fourth coded file was transmitted and/or stored via a TV/Video transmission channel. 30
  • an integrated circuit board such as a Frame Grabber or by similar equipment as known in the art. which may deliver an output of 24 bits per pixel.
  • the transmitted fourth coded file has been obtained at the receiving end by a regular fax machine or if it in printed form, it is read by said electro-optical means, for example a colour or black-and-white scanner, depending on the application, and the results of the reading are sent to a computer means which stores them in digital form, 0's and l 's representing the printed colour cells, which are typically white or black.
  • the said electro-optical means may have a different resolution to the sending means, and thus an array of P2 pixels may be associated with each of the bits of the received computer file. Typically, P2 may be 9 or (3x3) pixels, or more.
  • the said fourth coded file is stored in the aforesaid digital storage means or television/video storage means, it is read using suitable digital reading means or television/video storage reading means, respectively, and via a suitable interface as known in the art, the results of reading are sent to a computer means.
  • an array of P2 pixels may be associated with each of the bits of the original third coded file, where, typically, P2 may be 1 or (1x1) pixels, or more.
  • the transmitted said fourth coded file is received by television/Video receiving means
  • the received video signal is suitably converted into a computer file by the said computer means in a manner known in the art. for example using a standard Frame Grabber, wherein array of P2 bits may be associated with each ofthe colour cells ofthe original fourth coded file.
  • the received data file requires to be preprocessed, wherein the R. G, and B values of each pixel is converted via a suitable conversion rule to the nearest "digital-equivalent" value according to said conversion rule.
  • the digital value of a predetermined portion of a given received pixel/bit may taken as being "1" if the corresponding component of the RGB value is greater than 127, and "0" if it is less than or equal to 127, though other conversion rules may be adopted.
  • a received/read colour cell of comprises 3 rows of 5 bits each, for example, wherein each bit is represented by 4 pixels whose corresponding R, G, and B values are shown therein.
  • the R, G, and B values are read, and are converted via the aforementioned conversion rule, to generate a digital array, as shown in Figure 4(b).
  • each pixel having R, G, and B component values wherein (R 2 + G 2 + B 2 ) is greater than (127 2 + 127 2 + 127 2 ) is represented by a bit having a value of "1", and wherein (R 2 + G 2 + B 2 ) is less than or equal to (127 + 127 + 127 ) the pixel is represented by a "0".
  • each read pixel will be considered as corresponding to a bit having a digital value of "1" or "0", or, alternatively, vice versa.
  • the next step of the process of receiving and recovering the transmitted data comprises synchronising the received data file.
  • the next step of the process of receiving and recovering the transmitted data comprises generating a second decoded file directly from the received data file, as hereinafter described.
  • a map comprising a predetermined number of suitable logical zones is first defined over said received data file according to a predetermined mapping procedure, wherein each said logical zone comprises an array of elements each defined by a predetermined number P2 of received pixels. This step is performed as a "first guess " step to determine the most probable location of each of the transmitted third coded file arrays.
  • the said predetermined mapping procedure comprises preprocessing the said received data file as follows. First, the size of the received data file is determined, and the total width and height of the grid included in the image represented by the file is determined. By knowing the resolution of the electro-optical scanning means, the size of each element may be determined at least approximately. By knowing the width, height, density and the scanning resolution, it is then possible to calculate the size of an expected third coded file array in terms ofthe received data file.
  • one logical zone of the received data file is shown in graphical form, at a greatly enlarged scale, in Figure 1.
  • the third coded file was generated by the aforesaid third coding procedure, wherein the second coded file is divided into groups of 2 bytes, and a third byte is generated by applying an XOR rule to the first and second bytes to generate a third byte, which is subsequently intercalated between the first and second byte.
  • the predetermined number, F, of bits in each fourth coded file array of the said fourth coded file is 1, so that if printed, for example, the said third coded file is represented by white and black colour cells.
  • the logical zone will be constituted by digital values. 0's and l 's. the order of which is not determined by the graphic formulae, but is registered in the memory of the computer means in any convenient form.
  • the logical zone is shown as a graphic entity, comprised of cells of pixels, each cell corresponding to an element, which in turn is intended to 33
  • each cell comprising an array of P2 pixels or received bits, wherein for the purpose of example.
  • P2 is chosen as 9.
  • a third decoded file comprising Y2 decoded legitimate or substitute arrays, as hereinafter defined, is generated as follows. For each said logical zone, or adjusted logical zone as hereinafter defined, the following steps are performed:-
  • an estimated read array comprising estimated digital values corresponding to the digital values of the said elements defining said logical zone or adjusted logical zone, comprising for said each element the step of reading with said computer means one or more bits of the received bit/pixel array corresponding to each said element and/or one or more bits of the received bit/pixel array corresponding to an element adjacent to each said element according to a predetermined variable reading procedure for estimating a digital value corresponding to each said element;
  • the said estimated read array is recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array, wherein a legitimate third decoded array comprising tl bits is generated corresponding to said estimated read array; or 34
  • steps (ii) and (b) are sequentially repeated up to a predetermined limit, each time the said predetermined reading procedure in (a) providing a different regenerated estimated read array for decoding in (b).
  • an estimated read array is generated according to a predetermined variable reading procedure, as follows.
  • each element of the logical zone of Figure 1 comprises 9 sub-pixels.
  • An "x" is marked in Figure 1 to indicate each black pixel and the absence of such an "x" indicates a white pixel.
  • all the pixels of each element should be the same. viz. all white or all black. In this example, channel errors have been introduced, and a number of pixels which should be black are white, and vice versa. 35
  • the said computer means then reads one or more bits/pixels of the received bit/pixel array corresponding to each said element of the logical zone, or adjusted logical zone as hereinafter defined, according to said reading procedure.
  • This reading procedure may comprise reading pixels according to a positional rale , for example. For instance, the pixels occurring at position 1 in each cell may be read. Or, a different rale may be adopted, for instance, reading the pixel in position 1 for the 1st element, the pixel in the position 2 for the second element, and so on. Alternatively, more than one element may be read, and an average value found and corrected to a 1 or a 0, depending on which is closer to the average value found. For example, the pixels at positions 1.
  • a third decoding procedure is applied to the estimated read array.
  • the said third decoding procedure essentially corresponds of the said third coding procedure in reverse, and enables the said estimated read array to be recognised as a legitimate array in the event that errors from zero up to a predetermined third error level are present in said estimated read array.
  • the said estimated read array is registered as a legitimate third coded file array.
  • the computer means re-reads the pixels comprising the elements of said logical zone in a different manner according to 36
  • the said reading procedure may read the pixels at position 2 to derive another estimated read array for the said logical zone. If this estimated read array is still not recognisable as a legitimate array as hereinbefore described, the reading procedure may be sequentially employed a 3rd or 4th or 5th time up to a predetermined number of times, each time reading the 3rd, or 4th or 5th pixel in each element, respectively, regenerating an estimated read array, and applying the said third decoding procedure for recognising the regenerated read array as a legitimate array.
  • the predetermined reading limit may be 9, wherein the said reading procedure may read the pixels comprising each element up to 9 times, corresponding to reading the pixels in position 1, up to reading the pixels in position 9.
  • the said reading limit may be 25, wherein the reading procedure may be applied 25 times to the pixels of each element (plus surrounding pixels, as shown in Figure 3(b)), to sequentially regenerate an estimated read file 25 times, each time applying the said third decoding rule to determine whether the latest estimated read array is a legitimate array.
  • the said reading procedure may have a different form, and many different permutations are possible.
  • Figures 2(a) and 2(b) illustrate a portion of the received file, wherein a typical logical zone is marked LZl, and a second logical zone adjacent to it is marked
  • LZ2 the size of a cell in these figures is illustrated by the shaded area marked
  • position 7 is renumbered as position No. 1 according to the positional numbering adopted, essentially realigning the logical zone (LZl) by one pixel to the right and one pixel up (ALZ1).
  • LZl logical zone
  • AZA1 logical zone 1
  • the map of logical zones from this part of the received data file and onwards is then readjusted so that all the previously defined logical zones from here on are similarly displaced to the right and up by one pixel, until the next adjustment, if any.
  • the original logical zone (LZ2) next to the current logical zone (ALZ1) is therefore also replaced by an adjusted logical zone, (ALZ2), as illustrated in Figure 2(b).
  • ALZ2 adjusted logical zone
  • substitution rale may comprise, for example, generating a substitute array comprising the digital values of the pixels at a predetermined position e.g. position 1 or 4, in each element of the said logical zone or adjusted logical zone.
  • said substitution rule may comprise, generating a substitute array comprising the average digital values of 2 or more predetermined pixels in each element of the said logical zone or adjusted logical zone.
  • said substitution rale may comprise choosing for said logical zone or adjusted logical zone the estimate read array, as generated by said reading procedure, closest to a legitimate array, even though errors greater than said third error level may be present in the estimated read array.
  • the same procedure may be used for reading a coded file which has been printed on a print substrate and has been stored or physically transported form place to place.
  • the same procedure may be applied to data stored in a digital medium or in a stored or transmitted in a television-video storage or transmission medium, respectively, mutatis mutandis.
  • the case wherein the third coded file is transformed into a fourth code file comprising fourth coded file arrays, wherein the predetermined number, F , of bits is greater than 1 is treated in a similar fashion.
  • the process of the present invention may forther comprise, prior to applying said third coding procedure to said first computer file, regenerating first file arrays by applying a predetermined reversible first coding procedure to said first computer file arrays, wherein to generate corresponding first coded file arrays, wherein each said first coded file array is characterised in comprising a suitable error correcting code, as hereinbefore described, for recovering the corresponding said first computer file array in the event that errors up to a predetermined first error level are introduced into said first coded file array.
  • a first decoded data file comprising X2 first decoded arrays of nl bits is then generated by applying a predetermined first decoding procedure to said third decoded data file in a similar manner to that described hereinafter with reference to generating said first decoded file from a second decoded file, mutatis mutandis.
  • the step of synchronising the received data file is not required, i.e., the generation of said third decoded file from said received data file, and the next step of the process of receiving and recovering the transmitted data comprises generating a second decoded file directly from the received data file, as hereinafter described.
  • the present invention also relates to a process for receiving information, wherein said information is originally embodied in a first computer file comprising first computer file arrays and encoded by means of a predetermined encoding procedure and subsequently transmitted and/or stored via suitable channel means, preferably as hereinbefore described, said process comprising the steps of :-
  • (HI) generating a first decoded data file comprising first decoded file arrays by applying a predetermined first decoding procedure to said second decoded data file, wherein for each said second decoded file array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first decoded file array having a probability, greater than a predetermined probability threshold, of being identical to a corresponding array of said first computer file.
  • synchronisation of the received data file is first carried out as hereinbefore described, thereby generating a third decoded data file.
  • the third decoded file then comprises legitimate array or substitute arrays thus generated, each array comprising Tl bits, as in the third ceded file 40
  • a second . decoded data file comprising X2 second decoded arrays of si bits is generated by applying a predetermined second decoding procedure to said third decoded data file.
  • Said predetermined second decoding procedure corresponds to said second coding procedure, as hereinbefore described for example, in reverse, wherein adjacent bits defining each said second decoded array were previously dispersed one from another in said third decoded data file.
  • each said second decoded file array comprises a relatively low proportion of errors, relative to some of the third coded file arrays, which may be comprised exclusively of burst errors, e.g. some or all ofthe aforesaid substitute arrays, the data of which cannot be directly recovered.
  • the said second decoded data file is generated directly from the said received data file in a similar manner to that described above regarding the generation of the said second decoded data file from the said third decoded data file, mutatis mutandis.
  • a first decoded data file comprising X2 first decoded arrays of nl bits is then generated by applying a predetermined first decoding procedure to said second decoded data file.
  • Said first decoding procedure corresponds to said first coding procedure, as hereinbefore described for example, in reverse, wherein for each said second decoded array said first decoding procedure enables errors possibly comprised therein up to a predetermined first error level to be corrected to determine a legitimate first 41
  • the said first coding procedure is applied in reverse to the said second coded file arrays, in each case generating a first coded file array.
  • the said decoding procedure essentially enables first coded arrays to be generated having a probability greater than a predetermined probability threshold of being identical to a corresponding array of the first computer file.
  • the said first decoding procedure may optionally generate an error array corresponding to second coded file arrays for which no legitimate first decoded array can be found.
  • the said error arrays are easily recognisable, and may correspond to. say the ASCII code for a "@" or a "space " , when the first computer file comprises ASCII characters, for example.
  • the said first decoded data file is generated directly from the said third decode data file in a similar manner to that described above regarding the generation of the said first decoded data file from the said second decoded data file, mutatis mutandis.
  • the precise process used for decoding the received data file and thus recovering the original transmitted and/or stored information e.g. either the said first, second and third decoding procedures, or the said first and third decoding procedures, or the said first and second decoding procedures, will depend on the manner in which the original information in the form of said first computer file was similarly encoded, i.e., for example, using the said first, second and third coding procedures, or the said first and third coding procedures, or the said first and second coding procedures, respectively.
  • the information that it is intended to transmit according to the process of the present invention may also be compressed prior to embodying in the said computer file. Compression of the data is often preferable, in order to shorten transmission time and/or storage space of the said third coded file, and many 42
  • MADAM I AM ADAM is represented by a succession of 8-bit bytes, represented by the following decimal numbers, wherein each decimal number stands for the 8-bit bytes which, in binary numbers, has the same value: 77, 65, 68, 65, 77, 32, 73, 32, 65, 77, 32. 65, 68, 65. 77.
  • the compression programs that can be applied for carrying out the compression steps are based on the principles generally described in Richard W. Hamming - Coding and Information Theory, Prentice-Hall, Inc., 1980, particularly Variable Length Codes - Huffman Codes (Chapter 4) .
  • Examples of programs that can be purchased on the market are Arj,_Pkware, Pkzip, etc.. In this case, it will be assumed that the Pkware program is applied. This will compress the message "MADAM I AM ADAM" as follows.
  • the message contains three times A, four times M, three times a space, twice D and once I.
  • the ASCII symbol corresponding to each of these characters is 8 bits long. A new series of bits is assigned to each symbol, taking into consideration their frequency.
  • the above five characters (A. M, space. D, I) can be represented in three bits per symbol ofthe 8 binary symbols: 43
  • the new compressed message will be:
  • the process ofthe present invention comprises the forther step of decompressing the said first decoded file according to an appropriate decompressing procedure, wherein to obtain the original information, subject to the aforesaid first probability threshold.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Multimedia (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Correction Of Errors (AREA)
  • Facsimile Transmission Control (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

Un procédé de transmission et/ou de stockage d'informations comprend les étapes consistant à disposer des informations dans un premier fichier informatique comprenant un certain nombre de bits, dans lequel les bits sont agencés dans des rangées consécutives du premier fichier informatique, comprenant chacune un nombre prédéterminé de bits. Ensuite, le procédé consiste à produire un premier fichier de données codées comprenant des rangées codées du premier fichier par application d'une première procédure de codage prédéterminée réversible aux rangées du premier fichier informatique, dans lesquelles chaque rangée du premier fichier informatique est caractérisée en ce qu'elle comprend un code de correction d'erreurs approprié permettant de récupérer la rangée correspondante du premier fichier informatique dans le cas où des erreurs allant jusqu'à un premier niveau d'erreur prédéterminé seraient introduites dans la rangée du premier fichier codé. Ensuite, le procédé consiste à produire un seconde fichier de données codées contenant des rangées du second fichier codé par application d'une seconde procédure de codage prédéterminée réversible aux rangées du premier fichier de données codées, dans lesquelles les bits adjacents constituant chaque rangée du premier fichier codé sont réagencés pour être dispersés dans les seconds fichiers de données codées. Ensuite, le procédé consiste à transmettre et/ou à stocker le second fichier codé, ou un quatrième fichier codé comprenant des rangées d'un quatrième fichier codé produites à partir du second fichier codé tel que ci-après défini, via un canal approprié, une rangée prédéterminée de bits/pixels P1 pouvant être associée à chaque bit des secondes rangées codées ou des rangées du quatrième fichier codé, respectivement.
EP99914740A 1998-04-21 1999-04-20 Procede de transmission, de reception et/ou de stockage d'informations Withdrawn EP1074110A1 (fr)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
IL12415298 1998-04-21
IL12415298 1998-04-21
PCT/IL1999/000208 WO1999055037A1 (fr) 1998-04-21 1999-04-20 Procede de transmission, de reception et/ou de stockage d'informations

Publications (1)

Publication Number Publication Date
EP1074110A1 true EP1074110A1 (fr) 2001-02-07

Family

ID=11071424

Family Applications (1)

Application Number Title Priority Date Filing Date
EP99914740A Withdrawn EP1074110A1 (fr) 1998-04-21 1999-04-20 Procede de transmission, de reception et/ou de stockage d'informations

Country Status (5)

Country Link
EP (1) EP1074110A1 (fr)
JP (1) JP2002512482A (fr)
AU (1) AU3343599A (fr)
CA (1) CA2329179A1 (fr)
WO (1) WO1999055037A1 (fr)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7248934B1 (en) 2000-10-31 2007-07-24 Creative Technology Ltd Method of transmitting a one-dimensional signal using a two-dimensional analog medium
JP4568732B2 (ja) 2003-12-19 2010-10-27 クリエイティブ テクノロジー リミテッド デジタル画像を処理するための方法とそのシステム
EP1713063B1 (fr) 2003-12-19 2011-03-16 Creative Technology Ltd. Format audio imprimable

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4271520A (en) * 1979-06-25 1981-06-02 Motorola, Inc. Synchronizing technique for an error correcting digital transmission system
JPS5864844A (ja) * 1981-10-15 1983-04-18 Victor Co Of Japan Ltd 同期検出方式
JPS63168734A (ja) * 1987-01-07 1988-07-12 Fuji Sangyo Kk デジタル計算機のエラ−の検出・訂正方法
US4807230A (en) * 1987-05-29 1989-02-21 Racal Data Communications Inc. Frame synchronization
DE69323592T2 (de) * 1992-11-15 1999-10-21 Fontech Ltd Verfahren zum Übertragen und/oder Speichern von Informationen
JPH06216882A (ja) * 1993-01-19 1994-08-05 Matsushita Electric Ind Co Ltd 誤り訂正送信装置及び受信装置
AU665716B2 (en) * 1993-07-05 1996-01-11 Mitsubishi Denki Kabushiki Kaisha A transmitter for encoding error correction codes and a receiver for decoding error correction codes on a transmission frame
FR2724474B1 (fr) * 1994-09-13 1996-11-08 Regnier Jean Procede de codage et de decodage de documents

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO9955037A1 *

Also Published As

Publication number Publication date
AU3343599A (en) 1999-11-08
JP2002512482A (ja) 2002-04-23
CA2329179A1 (fr) 1999-10-28
WO1999055037A1 (fr) 1999-10-28

Similar Documents

Publication Publication Date Title
JP3202904B2 (ja) ディジタル信号を符号化するためのｎ次元トレリス符号化変調方法
US5337362A (en) Method and apparatus for placing data onto plain paper
EP0083127B1 (fr) Système pour la transmission de signaux d'image de télévision utilisant le codage de la transformation de sous-images
US6144324A (en) Method of modulating and demodulating digital data and digital data modulator/demodulator
EP0929969B1 (fr) Codeur
EP0598357B1 (fr) Procédé de transmission et/ou de stockage d'informations
EP1560146A2 (fr) Code à points tridimensionel
US3585586A (en) Facsimile transmission system
US5801848A (en) Process for transmitting and/or storing information
Villán et al. Multilevel 2D bar codes: toward high capacity storage modules for multimedia security and management
EP1074110A1 (fr) Procede de transmission, de reception et/ou de stockage d'informations
CN1128456A (zh) 图像通讯设备
US6427920B1 (en) High frequency masking of embedded digital data to improve appearance
CA1089088A (fr) Dispositifs et methodes de codage et de decodage de longueur de course
US5761217A (en) Method for recovering errors with data communication
JPH0789618B2 (ja) 画像符号化方法
JP2832024B2 (ja) 符号伝送方法
KR19980702077A (ko) 음성 기록 및 재생 장치
JP3291532B2 (ja) 復号化装置
JP3556363B2 (ja) 画像通信方法
JP3156484B2 (ja) ファクシミリ通信方式
JPH0823283A (ja) 通信方法及びモデム
JPH04252666A (ja) 画像伝送装置及び画像伝送方法
Yujun et al. Reliable Encoding and Decoding Algorithm of Sparse Lattice Information Based on the Printing-quantum-dots Image
JPH08331562A (ja) 画像通信方式

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20001110

AK Designated contracting states

Kind code of ref document: A1

Designated state(s): DE FR GB

17Q First examination report despatched

Effective date: 20010704

GRAH Despatch of communication of intention to grant a patent

Free format text: ORIGINAL CODE: EPIDOS IGRA

STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20030813