Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
181 words
A method of determining the cost of a telephone call made from a calling station having an area code and exchange number to a distantly located answering station having an area code and exchange number, comprising the steps of: (a) arranging the area codes and exchanges of the exchange system into an N×M matrix wherein N equals the area code numbers and M equals the exchange numbers, each combination of an area code number and an exchange number having a unique position in said matrix; (b) assigning a unique number to each of said positions in said matrix; (c) associating the position numbers with a plurality of respectively corresponding algorithms containing information relating to the distance between said stations; (d) selecting one of said algorithms using the position number of the answering station's area code and exchange number in said matrix; (e) storing call rate data related to the cost of placing calls between the calling station and a plurality of the answering stations; and (f) calculating said cost according to said one algorithm using the data stored in step (e).
Claim 2
Independent Claim
181 words
A method of determining the cost of a telephone call made from a calling station having an area code and exchange number to a distantly located answering station having an area code and exchange number, comprising the steps of: (a) arranging the area codes and exchanges of the exchange system into an N×M matrix wherein N equals the area code numbers and M equals the exchange numbers, each combination of an area code number and an exchange number having a unique position in said matrix; (b) assigning a unique number to each of said positions in said matrix; (c) associating the position numbers with a plurality of respectively corresponding algorithms containing information relating to the distance between said stations; (d) selecting one of said algorithms using the position number of the answering station's area code and exchange number in said matrix; (e) storing call rate data related to the cost of placing calls between the calling station and a plurality of the answering stations; and (f) calculating said cost according to said one algorithm using the data stored in step (e).
Claim 3
Dependent Claim
43 words
The method of claim 1, wherein step (a) is performed by providing a memory having N×M storage locations and storing a single bit of data in those of said storage locations which correspond to an existing combination of an area code and exchange.
Claim 4
Dependent Claim
61 words
The method of claim 1, wherein step (c) is performed by storing a plurality of multi-bit data words in a plurality of corresponding storage locations in a memory, each of said storage locations being related to a corresponding one of said position numbers, and step (d) is performed by addressing said storage locations using data words corresponding to said position numbers.
Claim 5
Dependent Claim
163 words
For use with a telephone system of the type having a plurality of telephone sets each possessing a unique call number, said call number including a unique area code number associated with the area within which the telephone set is located and a unique exchange number associated with the location of the telephone set with said area, a method of costing telephone calls between one of said telephone sets and any of the remianing number of said telephone sets, comprising the steps of: (a) precomputing distances between said one telephone set and each of said remaining number of telephone sets; (b) storing data corresponding to each of said distances in a memory; (c) recalling from said memory the data corresponding to the distance between said one telephone set and a telephone set in said remaining number thereof to which a call is placed from said one telephone set; and (d) calculating the cost of said call using the distance recalled in step (c).
Claim 6
Dependent Claim
163 words
For use with a telephone system of the type having a plurality of telephone sets each possessing a unique call number, said call number including a unique area code number associated with the area within which the telephone set is located and a unique exchange number associated with the location of the telephone set with said area, a method of costing telephone calls between one of said telephone sets and any of the remianing number of said telephone sets, comprising the steps of: (a) precomputing distances between said one telephone set and each of said remaining number of telephone sets; (b) storing data corresponding to each of said distances in a memory; (c) recalling from said memory the data corresponding to the distance between said one telephone set and a telephone set in said remaining number thereof to which a call is placed from said one telephone set; and (d) calculating the cost of said call using the distance recalled in step (c).
Claim 7
Dependent Claim
70 words
The method of claim 4, wherein step (b) includes the steps of: arranging the area codes and exchanges into an N×M matrix wherein N equals the number of area code numbers and M equals the number of exchange numbers, each combination of an area code number and an exchange number having a unique position in said matrix; and assigning a unique number to each of said positions in said matrix.
Claim 8
Independent Claim
109 words
A method of costing telephone calls from any of a first plurality of telephone sets having one copmbination of an area code and exchange number to any of a second plurality of telephone sets having a different combination of an area code and exchange number, each combination of an area code and exchange number being associated with a unique geographic area, comprising the steps of: (a) precomputing distance from the geographic area associated with said one combination to the geographic area associated with each of the different combinations of area codes and exchange numbers; and (b) calculating the cost of the calls using the distances precomputed in step (a).
Claim 9
Independent Claim
109 words
A method of costing telephone calls from any of a first plurality of telephone sets having one copmbination of an area code and exchange number to any of a second plurality of telephone sets having a different combination of an area code and exchange number, each combination of an area code and exchange number being associated with a unique geographic area, comprising the steps of: (a) precomputing distance from the geographic area associated with said one combination to the geographic area associated with each of the different combinations of area codes and exchange numbers; and (b) calculating the cost of the calls using the distances precomputed in step (a).
Claim 10
Dependent Claim
42 words
The method of claim 6, wherein step (a) includes substeps of arranging the different combinations of area codes and exchange numbers into bands of distances from said one combination and precomputing the distance from said one combination to each of said bands.
Claim 11
Dependent Claim
104 words
The method of claim 6, wherein step (a) is performed by: providing an N×M bit storage matrix where N equals the exchange numbers of said different combination and M equals the area codes of said different combination the position of each bit in said matrix identifying a unique area code and exchange number combination; selecting a particular bit in said matrix corresponding to the area code and exchange number being called; identifying the position of said particular bit in said matrix; and selecting one of a plurality of algorithms for calculating said cost based on the position of said particular bit in said matrix.
Claim 12
Dependent Claim
32 words
The method of claim 8, wherein the identifying step is performed by counting a number of vertical and horizontal storage locations from the location of the particular bit to a reference point
Claim 13
Dependent Claim
59 words
The method of claim 8, wherein step (a) is performed by inserting a bit in each storage location in said matrix which corresponds to a working combination of an area code and exchange number and inserting a null value in each storage location in said matrix which corresponds to a nonworking combination of an area code and exchange number.
Claim 14
Independent Claim
224 words
A system for costing telephone calls from any of a plurality of telephone sets having a particular combination of an area code and exchange number to any of a second plurality of telephone sets having other combinations of area codes and exchange numbers, wherein each combination of an area code and exchange number is associated with a unique geographic area and the cost of calls depends on a distance between the geographic areas, comprising: a first memory including a plurality of storage locations arranged in an N×M matrix and in which bits of data are stored, each data bit being uniquely associated iwth one of said other combinations of area codes and exchange numbers, and wherein N equals the area code numbers and M equals the exchange numbers; a second memory having a plurality of storage locations for respectively storing a plurality of multi-bit data words, each of said data words being uniquely associated with a position of one of said bits and defining an algorithm for determining the cost of the call; and a programmed computer including means for determining the position of each of said data bits in said first memory and means for calculating the cost of a call using the data word associated with the position of the data bit corresponding to the area code and exchange number being called.
Claim 15
Independent Claim
224 words
A system for costing telephone calls from any of a plurality of telephone sets having a particular combination of an area code and exchange number to any of a second plurality of telephone sets having other combinations of area codes and exchange numbers, wherein each combination of an area code and exchange number is associated with a unique geographic area and the cost of calls depends on a distance between the geographic areas, comprising: a first memory including a plurality of storage locations arranged in an N×M matrix and in which bits of data are stored, each data bit being uniquely associated iwth one of said other combinations of area codes and exchange numbers, and wherein N equals the area code numbers and M equals the exchange numbers; a second memory having a plurality of storage locations for respectively storing a plurality of multi-bit data words, each of said data words being uniquely associated with a position of one of said bits and defining an algorithm for determining the cost of the call; and a programmed computer including means for determining the position of each of said data bits in said first memory and means for calculating the cost of a call using the data word associated with the position of the data bit corresponding to the area code and exchange number being called.
Claim 16
Dependent Claim
19 words
The system of claim 11, wherein said first and second memories are defined on a bubble type memory device.
Claim 17
Dependent Claim
24 words
The system of claim 11, wherein said computer includes means for addressing said storage location using said positions determined by said position determining means.