an apparatus and method for autodiscriminating between a variety of symbologies is described in detail herein . in the following description , numerous specific details are set forth such as particular symbologies , arrays and data structures , weighting formulas and scanning apparatus , in order to provide a thorough understanding of the invention . one skilled in the relevant art , however , will readily recognize that the present invention can be practiced without specific details , or with other such details . in other instances , well - known structures and operations are not shown in detail in order to avoid obscuring the present invention . fig1 shows a sample of optical symbols from a variety of the optical symbologies which are available for identification purposes . the samples include a universal code symbol ( upc ) 2 , a code 39 symbol 4 , a code 93 symbol 6 , a code 128 symbol 8 , and a european automatic numbering system symbol ( ean ) 10 . these symbols 2 - 10 are all one - dimensional or linear bar code symbols . the linear symbologies store information in a parallel arrangement of varying width bars and spaces . the linear symbologies can also store information in a multiplicity of rows , as is done in the code 16k symbol 12 . matrix symbologies encode their data in the two - dimensional areas of a symbol , such as united parcel service &# 39 ; s symbol ( ups ) 14 , datacode symbol 16 , pdf417 symbol 18 , and vericode symbol 20 . as shown in fig2 an embodiment of the present invention is incorporated in a symbol reader 22 , which employs an optical beam 24 to read a symbol 26 . the symbol reader 22 includes an optical scanner 28 having an optical source 30 for producing the optical beam 24 . the optical source 30 may pass the beam 24 through a baffle 32 and an optical lens 34 . the optical source 30 may take the form of a visible or near - visible light source , such as a light - emitting diode ( led ), incandescent light source , or focused beam devices such as helium neon lasers or solid state laser diodes . the optical scanner 28 may also include conventional mechanisms for scanning the optical beam 24 , such as revolving polygons or oscillating mirrors ( not shown ). the optical scanner 28 further includes an optical receiver 36 for receiving the optical beam 24 after it is reflected from the symbol 26 . rather than scanning the transmitted light beam , it is also possible to scan the received light path as a whole with modern electronic detectors . this type of scanner is often referred to as a ccd scanner because of the use of charge - coupled device ( ccd ) semiconductor technology used for the photodiode array sensor or other image sensors . a ccd scanner is able to scan the received light path without any moving parts . a stationary flood illumination scheme is employed , and an image of the symbol is optically transferred to a linear array of multiple adjacent photodetectors . the array contains a sufficient number of photodiodes so that at least two photodiodes receive light from one of the narrowest elements to be resolved . the actual scanning motion is achieved by electrically scanning each of the individual photodiodes in a sequential manner . because there are so many diodes , and because they are very close together , the electrical output is a smooth wave form . an optical lens 38 may be provided for focusing the reflected optical beam 24 onto the optical receiver 36 . the optical receiver 36 may be formed as a photodiode array sensor , such as a charge - coupled device ( ccd ). the optical scanner 28 may further include an amplifier 40 for amplifying the signal from the optical receiver 36 and a wave shaper 42 for converting an analog voltage from the amplifier 40 into a digital signal which comprises a set of data 44 , often in the form of a time - varying binary signal switching between either of two states . the optical source 30 may be powered from an external source , or an internal source such as a rechargeable battery 46 . with continuing reference to fig2 a decoder 48 may be provided within the symbol reader 22 . alternatively , the decoder may be external to the symbol reader 22 and may take the form of a programmed general purpose computer ( not shown ). in the exemplary embodiment shown in fig2 the decoder 48 includes a microprocessor 50 and a memory 52 . the microprocessor 50 has an input port for receiving the set of data 44 generated by the optical receiver 36 . the microprocessor 50 also has input and output ports for communicating with an input and an output port of the memory 52 . the microprocessor 50 and the memory 52 may receive electrical energy from the battery 46 through a power bus 54 . the microprocessor 50 further has an output port 56 for relaying decoded symbol information to any of a variety of devices . the memory 52 contains a table of symbols for each symbology that the reader can decode . the microprocessor 50 and the memory 52 are configured to perform as an automated discriminator for selectively applying an appropriate symbology translation selected from the tables to the set of data 44 . a counter ( not shown ) may be implemented in the microprocessor 50 for counting the number of symbols successively decoded using each symbology . with reference to fig3 the symbol reader 22 includes a user interface 58 which may include a display screen 60 and a user input device 62 . while the user input device 62 is shown as comprising of a set of keys in the exemplary embodiment , the user input device 62 may take the form of a mouse , a touch screen , a trackball , a light pen , or any of a variety of conventional user input devices . the user input device may also take the form of a memory device ( not shown ) preconfigured with desired user input information . an appropriate memory device is selected by the user and loaded into a port ( not shown ) in the symbol reader 22 . the user input device 62 is preferably in data communication with the microprocessor 50 ( fig2 ). the user input device 62 may be used for loading a weight table into the memory 52 , or for loading or updating a weight factor in the memory 52 . the user input device may also be used to load or remove a symbology table from the symbol reader 22 . an exemplary method will be discussed with reference to fig2 and 4 . in step 202 , a first symbol 26 is scanned by directing light 24 produced by the optical scanner 28 to the first symbol 26 and receiving the reflected light 24 with the optical receiver 36 . the optical receiver 36 converts the received light 24 into a digital signal . in step 204 , the microprocessor 50 , determines the symbology to which the scanned first symbol 26 belongs . many symbologies have unique start and stop characters , which permit the symbology to be easily recognized through the use of lookup tables . alternatively , trial and error attempts at decoding the symbology with each of the symbologies loaded in the symbol reader 22 may be made by the microprocessor 50 . once the appropriate symbology has been determined , the microprocessor 50 decodes the digital signal in accordance with step 206 . the decoding is usually accomplished through the use of a set of lookup tables stored in the memory 52 . the lookup tables store data corresponding to the symbol pattern for each character of each symbology loaded in the symbol reader 22 . in step 208 , a weighted order table is updated ( as described below ) to reflect the updated frequency with which symbologies are being used to decode the symbols 26 . in step 210 , a new symbol 26 is scanned . in step 212 , the microprocessor 50 attempts to decode the new symbol 26 with the symbology having the highest priority . the priority will most often correspond to the frequency with which symbols of each symbology are decoded , the highest priority given to the most frequently occurring symbology . in step 214 , it is determined whether or not the symbol was successfully decoded based on the highest priority symbology . if the decode is successful , then the weighted order table is updated in accordance with step 208 . if the decode is unsuccessful , decoding with each of the remaining symbologies will be attempted in order of their priority , or weighted order as in accordance with step 216 . in step 218 , the success of decoding with the lower priority symbologies is tested , the weighted order table being updated ( step 208 ) each time a decode is successful . if no symbology is successful in decoding the symbol , an error message may be issued . with reference to fig5 a and 5b , a set of arrays for performing the method of the invention according to a first exemplary embodiment are shown . the arrays may be stored in the memory 52 ( fig2 ) for manipulation by the microprocessor 50 ( fig2 ). a first one - dimensional array 70 stores the names or other identifying data of the symbologies which the decoder 48 is capable of autodiscriminating between . the array 70 is referenced through an index 72 . a second one - dimensional array 74 stores values which are equal to the number of times each respective symbology has been used by the decoder 48 to decode a symbol 26 . the first array 70 and the second array 74 share the index 72 so that the values stored in the second array 74 directly correlate to the corresponding symbologies . in the example shown in fig5 a , the names or identifiers of a number n of symbologies are shown stored in the first array 70 . at this point , a total of eighty - three symbols have been decoded by the symbol reader , forty - seven of the decoded symbols correspond to the code 39 symbology , twelve of the decoded symbols correspond to the code 128 symbology , fourteen of the decoded symbols correspond to the code 93 symbology , and twenty of the decoded symbols correspond to the upc symbology . fig5 b shows the first and second arrays 70 , 74 after an additional symbol , in the code 93 symbology , has been scanned and decoded . note that the value at the index 72 equal to 3 in the second array 74 has been updated from 14 to 15 . in this embodiment , each entry in the array 74 corresponds to a weight assigned to a respective symbology from the first array 70 . as each new symbol is scanned , a series of symbology translations or transformations may be applied to the set of data 44 representing the symbol 26 , the translations being applied in a weighted order which corresponds to the weights in the array 74 . for example , the weighted order would most likely run successively from the largest weight to the lowest weight . the weighted order may be determined by examining or sorting the weights stored in the second array 74 using conventional sorting algorithms . additionally , a table of weights 75 for storing the symbology identifiers in the weighted order may be implemented as a third one dimensional array . the table of weights 75 stores the values of the index 72 which corresponds to the name or identifier of the respective symbologies . the table of weights 75 stores the values of the index 72 in their weighted order . for example , in fig5 a and 5b , the table of weights 75 stores in its first position the value 1 , which is equal to the index 72 that corresponds to the most frequently used symbology , code 39 . the table of weights 75 stores in its second position the value 4 , which is equal to the index 72 that corresponds to the second most frequently used symbology , upc . likewise , the table of weights 75 stores in its third and fourth positions the values 2 and 3 , which are equal to the index 72 that corresponds to the third and fourth most frequently used symbologies , respectively code 93 and code 128 . the software regularly updates the table of weights 75 . a user input may be accepted for modifying the weights stored in the weight table 75 , so as to influence the weighted order . where more than one symbology has the same weight , the most recently used symbology can be given priority in the weighted order . as shown in fig6 a - 6g , an alternative second exemplary embodiment under the present invention includes steps that are similar to those of the first exemplary embodiment . this alternative embodiment , and those described herein , are substantially similar to previously described embodiment , and common steps are identified by the same reference numbers . only the significant differences in operation are described in detail . the second exemplary embodiment is shown and described with reference to fig6 a - 6g , where more recent occurrences of symbologies are given more weight than older occurrences . this helps increase the speed of decoding when symbols of a given symbology occur in groups . with reference to fig6 a , a plurality of symbols 26 are shown . a window 80 is defined , the window corresponding to some number t of symbols . in the second exemplary embodiment , as shown in fig6 a , the window 80 corresponds to a number t equal to 5 symbols . the window size t directly affects the frequency with which the table of weights will be updated . the window size should be selected so that the table is updated at a reasonable rate , but not so often that the computations associated with the update consume a prohibitively large proportion of the microprocessor &# 39 ; s 50 bandwidth . with reference to fig6 b , a first array 82 is dimensioned for storing the name or identifier of the symbologies which the decoder 48 is programmed to autodiscriminate and decode . the first array 82 is referenced through an index 84 . a second array 86 includes a window count column 88 for storing values equal to the total number of times that a respective symbology has been used to decode a symbol in a given window . the array 86 also includes a weighted sum column 90 , which stores a value equal to a weighted sum of the cumulative count for each of the respective symbologies . fig6 c - 6g provide an example of the successive values of the second array 86 as the window 80 iterates through the plurality of symbols 26 . fig6 c shows the second array 86 prior to the scanning of the first symbol 26 . each of the values in the second array 86 are equal to zero . fig6 d shows the values in the second array 86 after the first window of symbols 80 has been scanned . in this example , three instances of code 39 symbols were decoded , one instance of a code 128 symbol was decoded , and one instance of a upc symbol was decoded . the values in window count column 88 have been updated to reflect this first window of symbols 80 . fig6 e shows the second array 86 just prior to scanning the second window 80 &# 39 ; of symbols 26 . weighted sum column 90 has been updated by storing the weighted sum of the cumulative count of each the respective symbols divided by a weight value . for example , a weight value equal to the window size of 5 is selected . hence , the values of 3 / 5 , 1 / 5 , and 1 / 5 are stored in the weighted sum column of array 86 in the rows corresponding to the code 39 , code 128 , and upc symbologies , respectively . the values in the window count column 88 are then zeroed out in preparation for the next window of symbols 80 &# 39 ;. it should be noted that although floating point values may be used , arrays of integer values are preferred to permit rapid computation , as well as for efficient use of the information stored in the arrays . one method for maintaining 16 - bit accuracy while operating on fractional values in an integer array is to multiple any numbers relating to the dividend in a division operation by the value 256 . in terms of the microprocessor 50 , the multiplication by 256 is simply a shift of 8 bit positions in the direction of increasing value . the division of the resulting dividend by a devisor having 8 - bit precision will result in a 16 - bit value where the quotient is in the upper 8 bits and the lower 8 bits represents a fractional value . this method will also work where the dividend is multiplied by 65 , 536 , which corresponds to a shift of 16 - bit positions , and the divisor has 16 - bit precision , the resulting quotient having 32 - bit precision . using 32 - bit values provides extended dynamic range over a 16 - bit value . these integer values can be referred to as fixed point fractional values . fig6 f shows the values of the second array 86 just after the symbols 26 of the second window 80 &# 39 ; have been scanned and decoded . in this example , two instances of code 39 symbols , two instances of code 128 symbols , and one instance of a upc symbol were decoded in the second window 80 &# 39 ;. the window count column 88 is updated accordingly . fig6 g shows the values of the second array 86 just prior to scanning the symbols of the third window 80 &# 34 ;. the values of the weighted sum column 90 are updated to reflect the occurrence of the respective symbols . for example , the existing weighted sum of the cumulative count for code 39 symbols , 3 / 5 , is divided by 5 , which is the weight , to arrive at the dividend 3 / 25 . to this value is added 2 / 5 , which is the dividend of the new total of code 39 symbols in the second window 80 &# 39 ;, which is equal to 2 , and the weight , which is equal to 5 . therefore , the weighted sum of the cumulative count for code 39 symbols is 13 / 25 , the sum of 3 / 25 and 2 / 5 . mathematically , the value for the weighted sum of any given symbology is given by the following formula , where &# 34 ; i &# 34 ; is the current window : the weighted sums for code 128 and upc symbologies are likewise computed , as shown in fig6 g . the equation ( 1 ) above may employ multiplication instead of division , where for instance , the counts are given in terms of frequency ( i . e . 1 / count ). the weight chosen is preferably equal to or greater than the size of the window t . selecting a value equal to or greater than t ensures that the weighted sum will never be greater than 1 . again , the software method of fig4 may be employed to apply symbology translations in an order which corresponds to the weighted order defined by the weighted sums in the second column 90 of the second array 86 . with reference to fig7 a two - dimensional array 100 is shown for implementing a method according to a third exemplary embodiment of the invention . the method works with the plurality of symbols 26 and the window 80 as shown in fig6 a , and with a similar name or identifier array 84 as shown in fig6 b . the array 100 includes a window count column 102 which stores values equal to the number of times that a respective symbology has been employed to decode a symbol 26 in a given window . a weighted sum column 104 stores the values which are equal to a weighted sum of the cumulative count for each of the respective symbologies . a set of rate columns 106 , 107 , 108 are provided for storing rate information for each of the respective symbologies . as defined above in equation ( 1 ), the weighted sum is equal to the sum of the prior weighted sum divided by the weight and the current window count divided by the weight . the rate is equal to the current weighted sum minus the previous weighted sum , and is given by the equation , where &# 34 ; i &# 34 ; is the current window : the number of rate columns 106 - 108 can be increased or decreased according to the needs of the system and the user . each of the rate columns 106 - 108 represents the change between successive pairs of windows . for example , the first rate column 106 will represent the change between the first window 80 , which includes the first five symbols 26 , and the second window 80 &# 39 ;, which includes the second five symbols 26 . likewise , the second rate column 107 will represent the change between the second window 80 &# 39 ;, or second set of five symbols 26 , and the third window 80 &# 34 ;, or third set of five symbols 26 . once each of the rate columns have been successively filled , the process begins again starting with the next successive window , and successively overwriting each of the rate columns as each successive window is processed . the value of the most current rate may be identified through the use of a pointer which is updated each time the rate information is updated . an average weight column 110 is provided for storing the average value of the rates for each of the respective symbologies . the average weight is used to moderate the noise which appears in the individual rates as erratic changes in direction and amplitude , and which corresponds to the ever changing frequency counts for the symbologies . in order to increase computational efficiency , the average need not be divided by the total number of rates , as this would only scale the rate average across all symbologies , and not affect the relative values between the symbologies . it should be noted that the value selected for the weight inversely affects the retention of old information in the weighted sum . in other words , the greater the weight , the less the old information influences the weighted sum . with reference to fig7 a , the values of the array 100 are shown just after reading and decoding the first window 80 of symbols 26 . in this example , three instances of code 39 , one instance of code 128 , and one instance of upc symbols have been encountered . the weight value chosen in this example is 6 . in practical embodiments the weight may be significantly larger . the weighted sums for code 39 , code 128 , and upc symbologies are 3 / 6 , 1 / 6 , and 1 / 6 , respectively . no rate information is generated since this is the first window to be read and decoded . with reference to fig7 b , the values of the array 100 are shown after reading and decoding the symbols 26 of the second window 80 &# 39 ; ( fig6 a ). two instances of code 39 , two instances of code 128 , and one instance of upc symbols were encountered in the second window 80 &# 39 ;. in this instance , since a prior window had been processed , rate information can be calculated and stored in the first rate column 106 . for example , with respect to the code 39 symbology which is stored in the row indexed by 1 , the prior weighted sum 3 / 6 is subtracted from the current weighted sum 15 / 36 to give a rate of - 3 / 36 . the sign of the rate provides an indication of the direction , while the size provides an indication of the magnitude of the change . the average rate of change 110 is the sum of all of the stored rate of changes 106 - 108 and is therefore equal to - 3 / 36 . similar calculations are performed for all the other symbologies stored in the table . with reference to fig7 c , the array 100 is shown with the values as they appear after reading and decoding a third window 80 &# 34 ;, comprising the third set of five symbols 26 . in the third window 80 &# 34 ;, one code 39 symbol , two code 128 symbols , one upc symbol , and one datacode symbol were encountered . the window count column 102 has been correspondingly updated . the weighted sums 104 are also correspondingly updated . for example , with reference to the row indexed by 1 , the weighted sum is equal to the prior weighted sum , 15 / 36 , divided by the weight , 6 , plus the current window count , 1 , divided by the weight , 6 . the new weighted sum for the code 39 symbology is equal to 15 / 216 + 36 / 216 , or 51 / 216 . the second rate column 107 is updated , by calculating the difference between the new weighted sum and the previous weighted sum . the average weight 110 is calculated by summing the first rate and the second rate . in this embodiment , the average weight column 110 may serve as the weight table , or may by used to influence the weighted order of a weight table ( not shown ). although specific embodiments of the automated discriminator and method of autodiscrimination , and examples of the present invention have been described above for illustrative purposes , various equivalent modifications may be made without departing from the spirit and scope of the invention , as will be recognized by those skilled in the relevant art . the teachings provided herein of the present invention can be applied to other symbol readers and symbologies , not necessarily the exemplary symbol reader and symbologies generally described above . for example , a hardwired system or programmed general - purpose computer could be substituted for the microprocessor . the arrays and data structures for manipulating the information may be significantly modified , as well as , the formulas , from those described above while still realizing advantages of the invention . the terms weight , weights , weight table and weighted order in the most basic sense apply to a frequency , or a ranking or priority ordered by the frequency with which symbols of a particular symbology occur . as explained above , the terms weight , weights , weight table and weighted order can encompass more complicated formulations , for example placing greater emphasis on more recently occurring symbologies . in another example , the more complicated formulation may include a defined weighting factor which may be provided by a user or by other means . therefore , the terms weight , weights , weight table and weight order should not be given a restrictive meaning . these and other changes can be made to the invention in light of the above detailed description . in general , in the following claims , the terms should not be construed to limit the invention to the specific embodiments disclosed in the specification and claims , but should be construed to include all apparatus and methods for scanning and autodiscriminating symbols . accordingly , the invention is not limited by the disclosure , but instead its scope is to be determined entirely by the following claims .