Some content of this application is unavailable at the moment.
If this situation persist, please contact us atFeedback&Contact
1. (WO2002019536) RELATIONAL DIFFERENTIATION ENCODING
Latest bibliographic data on file with the International Bureau

Pub. No.: WO/2002/019536 International Application No.: PCT/US2001/026690
Publication Date: 07.03.2002 International Filing Date: 28.08.2001
Chapter 2 Demand Filed: 28.03.2002
IPC:
H03M 7/30 (2006.01)
H ELECTRICITY
03
BASIC ELECTRONIC CIRCUITRY
M
CODING, DECODING OR CODE CONVERSION, IN GENERAL
7
Conversion of a code where information is represented by a given sequence or number of digits to a code where the same information is represented by a different sequence or number of digits
30
Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
Applicants:
ZEOSYNC CORPORATION [US/US]; 310 Evernia Street Palm Beach, FL 33401, US (AllExceptUS)
ST. GEORGE, Peter [US/US]; US (UsOnly)
Inventors:
ST. GEORGE, Peter; US
Agent:
WINSTON, R., Whitney; Fish & Richardson 1425 K Street, N.W. Washington, DC 20005-3500, US
Priority Data:
60/228,62028.08.2000US
Title (EN) RELATIONAL DIFFERENTIATION ENCODING
(FR) CODAGE DE DIFFERENCIATION RELATIONNELLE
Abstract:
(EN) A system and method for encoding data is provided. A relational differentiation encoding module is used to encode a target value by constructing a set of values including the target, and then by differentiating the target from the constructed set of values. The constructed set of values may be defined by calculating the senior most bit (SMB) and the so many on/off bits (SMOB) of the target value. Armatures may be calculated to further differentiate the target value.
(FR) L'invention concerne un procédé et un système permettant de coder des données. Un module de codage de différenciation relationnelle est utilisé pour coder une valeur cible par construction d'un ensemble de valeurs comprenant ladite cible, puis par différenciation de ladite cible, et par différentiation de cette cible de l'ensemble de valeurs construit. L'ensemble de valeurs construit peut être défini par calcul du bit le plus ancien SMB (senior most bit) et des bits le plus souvent changés SMOB (so many on/off bit) de la valeur cible. Il est possible de calculer des armatures afin de différencier ultérieurement la valeur cible.
front page image
Designated States: AE, AG, AL, AM, AT, AU, AZ, BA, BB, BG, BR, BY, BZ, CA, CH, CN, CO, CR, CU, CZ, DE, DK, DM, DZ, EC, EE, ES, FI, GB, GD, GE, GH, GM, HR, HU, ID, IL, IN, IS, JP, KE, KG, KP, KR, KZ, LC, LK, LR, LS, LT, LU, LV, MA, MD, MG, MK, MN, MW, MX, MZ, NO, NZ, PL, PT, RO, RU, SD, SE, SG, SI, SK, SL, TJ, TM, TR, TT, TZ, UA, UG, US, UZ, VN, YU, ZA, ZW
African Regional Intellectual Property Organization (ARIPO) (GH, GM, KE, LS, MW, MZ, SD, SL, SZ, TZ, UG, ZW)
Eurasian Patent Organization (AM, AZ, BY, KG, KZ, MD, RU, TJ, TM)
European Patent Office (AT, BE, CH, CY, DE, DK, ES, FI, FR, GB, GR, IE, IT, LU, MC, NL, PT, SE, TR)
African Intellectual Property Organization (BF, BJ, CF, CG, CI, CM, GA, GN, GQ, GW, ML, MR, NE, SN, TD, TG)
Publication Language: English (EN)
Filing Language: English (EN)
Also published as:
AU2001285309