the steps and procedures of method embodiments generally described below are characterized in the flow charts shown in fig6 - 15 . fig6 is a flow chart and fig1 is a sequence diagram illustrating at a high level the basic steps of an embodiment of a method of the present invention , which are preferably implemented in software , firmware , or other programmable medium . embodiments of methods of the present invention are herein described with respect to a tpms rf signal represented by a data frame and blocks . however , embodiments of the present invention may be employed with any number of rf signals employing data frames and blocks . as detailed below , various embodiments of the present invention may include a number of steps including the following . manchester encoded data frames or the like are received over a wireless link , such as may be provided in a tpms and wherein the data frames have checksums and are comprised of symbols , the symbols each having a symbol period . errors in the received data frames my be detected by determining whether each symbol is present in the received data frame , wherein each data error has a location in the received data frame and the presence of each symbol is detected by utilizing edge detection windows having a duration of one symbol period . the symbols in the received data frame may be marked as data errors if the edge detection window closes without a symbol being detected . the location of each data error may be stored in a system memory . data frames may be discarded if the number of data errors exceeds a programmable threshold level . it may be determined if the data frames are correctable by utilizing a data correction algorithm , such as a cyclic redundancy check algorithm , wherein the data correction algorithm recalls and changes only the data errors in an attempt to satisfy the checksum so that the number of iterations used by the data correction algorithm in attempting to satisfy the checksum is reduced by not attempting iterations with changes to known good data . all modified data frames that satisfy the checksum may be stored to the system memory . in accordance with some embodiments of the present invention if the number of data errors exceeds a fixed number , such as four data errors , the received data frames may be discarded . the received data frames may be corrected if only one modified data frame satisfies the checksum . all other remaining data frames may be discarded as uncorrectable . finally , the corrected data frames may be validated against programmable boundary thresholds . as illustrated in fig1 , a tpms rf data frame comprises a sequence of symbols or bits defining a preamble followed by a payload of m bits or symbols . the first step in decoding the rf data is to detect the start of a frame so that the tpms processor can prepare itself to decode the entire frame . fig2 shows a received rf data line with no rf activity by the tpms transmitter . as can be seen , the rf section in the tpms receiver is constantly picking up noise . because of this , it would be impossible for the tpms processor to monitor every pulse on the rf data input line for the correct pulse width . thus , in accordance with the present invention system hardware ( e . g ., in the vehicle electronic control unit ) preferably supplies a mark detect circuit that will trigger on detecting the correct pulse width and power level for a double mark . fig3 shows a received rf data line with tpms transmitter rf activity . fig3 also shows triggering of the rf mark detect line . because the tpms processor is not constantly processing noise in the received rf data line searching for the start of a rf frame , the processing load on the tpms processor and / or similar equipment is decreased . with attention directed to fig6 , after the tpms is activated , software in the tpms processor causes the processor to ( 1 ) wait until a mark is detected . when a mark is detected , ( 2 ) measurement of maximum peak detect output ( pdo ) is started . following mark detect , a stream of manchester encoded payload data is sent to the tpms processor and ( 3 )-( 6 ) decoding of the frame begins . the mark detect circuitry can be sensitive , so the preamble should be validated to ensure that it actually represents the start of a tpms rf data frame . therefore , as seen on fig7 , frame decoding includes ( 3 ) validation of the preamble of the data frame . the first and second parts of the preamble are validated using different procedures and / or programmable boundary parameters . referring to fig7 , the mark detect circuitry will trigger at a position within the double mark that is not predictable . consequently , a check can be made that validates the maximum pulse width . this procedure ( validation of the first part of the preamble ) is shown in fig8 and 13 . the width of a double mark is expressed as follows : transmitters in some different tpmss use different protocols , but use the same carrier frequency , the same or similar data rate , and a similar frame preamble . therefore , it is desirable to filter out signals from transmitters that do not use the specified system protocol because they are of no use to the subject system . also , it is desirable to insure that there are only a specific number of zeros , or other indicator , appears in the preamble of the data frame . as shown in fig7 , the bit timing of the zeros in the preamble may also be calculated and validated as part of the validation of the first part of the preamble . this is shown in fig9 and 14 . the bit width =( nominal bit width ± tolerance ). as seen in fig9 , the average bit time ( bit width ) may be calculated by detecting the falling edges of the first zero and the second to last zero in the first part of the preamble . if the calculated average bit time is within tolerances ( as established in the tpms software ), the calculated bit time may be used . otherwise , the nominal bit time may be used . looking at fig7 and 10 , the second part of the preamble can be validated ( 3 ) by decoding the next three bits in the preamble as manchester encoded bits and looking for a zero , mark and one . decoding of manchester encoded bits is described in more detail below . if either of the preamble validations fails , the preamble may be reported as being invalid . referring back to fig6 and 7 , synchronization ( 5 ) of the bit timer used for transmitted and received data must be performed . empirical data has showed that bit timing can be off significantly immediately after a large pulse , i . e . a double mark , zero , mark , one . thus , synchronization may preferably be initiated on the falling edge of the second to last preamble zero as shown on fig9 . this timer may indicate the start of a manchester bit . to enable this timer to consistently activate in the correct place , the ( 4 ) bit rate of the incoming frame should be known . one example of a tpms transmitter uses an rc oscillator for its timing so the bit rate will vary over temperature 4 . 096 khz ± 5 %. however , because the length of a frame is short approx 16 ms , the bit rate of the frame will be constant over the period of that frame , as the temperature cannot change significantly during in such a time frame . as shown on fig8 and 13 , the time between the falling edge of the first preamble zero and the falling edge of the fourth preamble zero is measured . the bit rate of the incoming frame can then be calculated down to an accuracy of 2 - 3 us . however over the period of one frame ( 60 + bits ), the bit timer will be significantly off time and so should be resynchronized periodically , as described below . a characteristic of manchester encoding is that a transition occurs in the middle of the bit . a rising edge corresponds to a manchester zero and a falling edge corresponds to a manchester one . ( fig4 ) to decode each manchester bit , a window is preferably opened inside of the bit as described in fig1 and 15 . inside this window , edge detect is preferably enabled . outside of this window , edge detect will preferably be disabled . this is illustrated in fig5 . when an edge is detected inside of the window , the rf data line is sampled in accordance with embodiments of the present invention immediately after the edge to find out if the bit was a zero or one . if the window is closed without an edge occurring then the bit is preferably marked as invalid . as noted above , the oscillator driving the bit timer in a tpms system can drift and the bit time can only be calculated to a certain accuracy . consequently , as seen on fig7 , the bit timer is preferably resynchronized in ( 5 ) in accordance with the present invention . the bit timer can be resynchronized on receiving a valid edge by reloading the bit timer with half the calculated bit time . this will mean that for the next bit , the edge should occur in the middle of the bit , thereby keeping the bit timer in synchronization . as seen on fig6 and 7 , decoding of bits in a frame continues until the entire frame payload has been decoded . as seen on fig6 , after a frame has been decoded , the ( 7 ) maximum pdo measurement is sampled and stored . this point represents an end of time - critical section of the rf decoding in the example tpms receiver . the frame can now be ( 8 ) buffered and passed to a lower priority task as shown on fig6 and processing of buffered frames can now begin . processing of the buffered data frames includes attempts to reconstruct frames with any bits marked as invalid . these include frames initially determined ( 9 ) to have invalid checksums . if the frame is reconstructed and the frame checksum is successfully revalidated , the frame payload information is ( 10 ) extracted and stored . if frame reconstruction is not possible then the frame is discarded . the frame reconstruction procedure is shown on fig1 . the frame checksum is calculated and any frames with invalid checksums are discarded . if the frame is not discarded , the information contained in the frame ( transmitter id , function code , pressure , temperature and checksum ) is then stored in a system memory and a timer is started . still referring to fig1 , during the frame decoding process , any bit where the tpms processor did not detect any edges is marked as invalid . frame reconstruction is processor intensive , so method embodiments of the present invention may filter - out as many invalid frames that are most likely beyond recovery as possible . these may include any frames with invalid bits in the checksum or any frames with an invalid bit count above a certain programmable threshold . in other words , a threshold may be provided in the tpms software that defines the maximum allowable corruption in a frame . if the degree of frame corruption ( i . e ., number of invalid bits ) exceeds this threshold , the frame may be discarded . frame reconstruction may be performed by using a cyclic redundancy check algorithm if the like which may try every possible combination of binary code in the frame locations where decoded bits were marked as invalid and then recheck using programmable boundary parameters , such as the checksum or a checksum algorithm . if the checksum passes , then that frame is stored and the number of possible solutions is incremented . all possible frame combinations may be tested . if only one solution is found , then the frame may be considered successfully reconstructed and may be passed . if there are no solutions or if there is more than one possible solution then the frame may be considered to be unreconstructable and the frame may be discarded . during testing of an embodiment of the present method , the task times tabulated were measured for the frame processing with various levels of frame reconstruction enabled . fig1 shows frame processing time as a function of the maximum number of invalid bits in the frame . in this example frames are received every 16 ms . however , free processing time between frames is used to service other operating system tasks , so the maximum processing time for a frame is fixed at 2 ms in this example . the maximum number of invalid bits in a frame to be reconstructed is set to four bits in the illustrated example . accordingly , in a worst case scenario , with frames constantly incoming , all of which are invalid with four invalid bits , then 2 ms / 16 ms or 12 . 5 % of the processing power will be used up processing frames in this example . as seen in fig6 , frame decoding may continue until the end of the tpms data block is reached . a tpms data block may be transmitted over the period of one second . in other words , one second after the first data frame is received in the tpms receiver , the block is complete . the data block can then be passed onto the rest of the tpms application . frames should be consistent within the same block , and a check is preferably made to ensure this . at the end of block processing , the average maximum pdo measurement is preferably calculated ( 11 ) and block processing may then be complete . as one of ordinary skill in the art should appreciate in light of the foregoing description and accompanying figures programming code can be written to implement embodiments of the present method . the programming language and the actual instructions used may depend on the tpms processor used , the operating system , and on the preferences of the programmer . as noted above , although embodiments of the various steps of the methods of the present invention have been described with respect to a remote tire pressure monitoring system , various embodiments of the present methods can be used with a variety of rf data link where improved data quality is an objective . although the present invention and its advantages have been described in detail , it should be understood that various changes , substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims . moreover , the scope of the present application is not intended to be limited to the particular embodiments of the process , machine , manufacture , composition of matter , means , methods and steps described in the specification . as one of ordinary skill in the art will readily appreciate from the disclosure of the present invention , processes , machines , manufacture , compositions of matter , means , methods , or steps , presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention . accordingly , the appended claims are intended to include within their scope such processes , machines , manufacture , compositions of matter , means , methods , or steps .