Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
68 words
A pulse modulation method for converting a binary code into a pulse-modulated signal, comprising: partitioning said code into a plurality of units consisting of 2-bits each; generating a pulse of width t for each unit; setting a pulse stop interval for each unit corresponding to said 2-bits in said unit; and forming said pulse-modulated signal by separating each pulse from a succeeding pulse by said pulse stop interval.
Claim 2
Dependent Claim
68 words
A pulse modulation method for converting a binary code into a pulse-modulated signal, comprising: partitioning said code into a plurality of units consisting of 2-bits each; generating a pulse of width t for each unit; setting a pulse stop interval for each unit corresponding to said 2-bits in said unit; and forming said pulse-modulated signal by separating each pulse from a succeeding pulse by said pulse stop interval.
Claim 3
Dependent Claim
72 words
A pulse modulation method as described in claim 1, further comprising: setting said pulse stop interval to 1t when said 2-bits of said unit are (0,0); setting said pulse stop interval to 2t when said 2-bits of said unit are (0,1); setting said pulse stop interval to 3t when said 2-bits of said unit are (1,0); and setting said pulse stop interval to 4t when said 2-bits of said unit are (1,1).
Claim 4
Dependent Claim
85 words
A pulse modulation method as described in claim 2, further comprising: determining a plurality of pulse intervals by combining each pulse and its associated pulse stop interval; summing said plurality of pulse intervals to produce a sum; adding an inversion flag to said pulse-modulated signal if said sum is greater than or equal to a number; inverting each of said 2-bit units, if said sum is greater than or equal to said number, before the step of setting said pulse stop interval for each unit.
Claim 5
Dependent Claim
31 words
A pulse modulation method as described in claim 3, wherein: said binary code consists of 4N-bits, where N is a positive integer; and said number equals one of 7Nt and (7N+1)t.
Claim 6
Dependent Claim
72 words
A pulse modulation method as described in claim 1, further comprising: setting said pulse stop interval to 4t when said 2-bits of said unit are (0,0); setting said pulse stop interval to 3t when said 2-bits of said unit are (0,1); setting said pulse stop interval to 2t when said 2-bits of said unit are (1,0); and setting said pulse stop interval to 1t when said 2-bits of said unit are (1,1).
Claim 7
Dependent Claim
85 words
A pulse modulation method as described in claim 5, further comprising: determining a plurality of pulse intervals by combining each pulse and its associated pulse stop interval; summing said plurality of pulse intervals to produce a sum; adding an inversion flag to said pulse-modulated signal if said sum is greater than or equal to a number; inverting each of said 2-bit units, if said sum is greater than or equal to said number, before the step of setting said pulse stop interval for each unit.
Claim 8
Dependent Claim
31 words
A pulse modulation method as described in claim 6, wherein: said binary code consists of 4N-bits, where N is a positive integer; and said number equals one of 7Nt and (7N+1)t.
Claim 9
Dependent Claim
95 words
A pulse modulation method for converting a binary code into a pulse-modulated signal, comprising: partitioning said code into a plurality of units consisting of 2-bits each; generating a pulse of width t for each unit; setting a pulse stop interval for each unit corresponding to said 2-bits in said unit; compressing each pulse stop interval by a compression constant k to produce a compressed pulse stop interval, k being a positive number between zero and one; and forming said pulse-modulated signal by separating each pulse from a succeeding pulse by said compressed pulse stop interval.
Claim 10
Dependent Claim
95 words
A pulse modulation method for converting a binary code into a pulse-modulated signal, comprising: partitioning said code into a plurality of units consisting of 2-bits each; generating a pulse of width t for each unit; setting a pulse stop interval for each unit corresponding to said 2-bits in said unit; compressing each pulse stop interval by a compression constant k to produce a compressed pulse stop interval, k being a positive number between zero and one; and forming said pulse-modulated signal by separating each pulse from a succeeding pulse by said compressed pulse stop interval.
Claim 11
Dependent Claim
76 words
A pulse modulation method as described in claim 8, further comprising: setting said compressed pulse stop interval to 1kt when said 2-bits of said unit are (0,0); setting said compressed pulse stop interval to 2kt when said 2-bits of said unit are (0,1); setting said compressed pulse stop interval to 3kt when said 2-bits of said unit are (1,0); and setting said compressed pulse stop interval to 4kt when said 2-bits of said unit are (1,1).
Claim 12
Dependent Claim
76 words
A pulse modulation method as described in claim 8, further comprising: setting said compressed pulse stop interval to 4kt when said 2-bits of said unit are (0,0); setting said compressed pulse stop interval to 3kt when said 2-bits of said unit are (0,1); setting said compressed pulse stop interval to 2kt when said 2-bits of said unit are (1,0); and setting said compressed pulse stop interval to 1kt when said 2-bits of said unit are (1,1).
Claim 13
Dependent Claim
88 words
A pulse modulation method as described in claim 8, further comprising: determining a plurality of pulse intervals by combining each pulse and its associated compressed pulse stop interval; summing said plurality of compressed pulse intervals to produce a sum; adding an inversion flag to said pulse-modulated signal if said sum is greater than or equal to a number; inverting each of said 2-bit units, if said sum is greater than or equal to said number, before the step of setting said compressed pulse stop interval for each unit.
Claim 14
Dependent Claim
38 words
A pulse modulation method as described in claim 11, wherein: said binary code consists of 4N-bits, where N is a positive integer; said compression constant k equals one half; and said number equals one of 5Nt and (5N+1)t.