Method for distinguishing between successively arrived messages and a pager incorporating the method

Abstract: Characters of successively arrived first (A) and second (B) messages are checked for error and stored into storage locations so that the characters of each message positionally correspond with those of the other. A first match (102) is detected between the number of all characters contained in the first message (A) and the number of those in the second message (B). A second match (103) is detected between each of error-free characters of the first message and each of positionally corresponding error-free characters of the second message. A mismatch (104) is then detected between each of the error-free and error-containing characters of the first message and each of positionally corresponding characters of the second message and the detected mismatch is counted (105). If the count (N E ) is smaller than a predetermined percentage of the number of all characters in each message, the messages are interpreted as containing the same information (2). Error-containing characters of one of the messages are replaced with positionally corresponding error-free characters of the other message. In a selective calling radio display pager, the character-replaced message is displayed.

Description: BACKGROUND OF THE INVENTION The present invention relates to a method for distinguishing between successively arrived messages. The present invention is particularly suited for use with a selective calling radio display pager. The state of the art with regard to correction of errors in a received message is described inter alia in the specification of European Patent Application EP-A 0,193,188, published in September 3, 1986 as a radio paging device having circuitry for rewriting a stored message with error-free characters. Radio paging signals of the same message are repeatedly transmitted to increase the probability of reception. In the prior art specification, characters of each message are checked for error and error-free characters are stored in a first memory and those characters of successively received message are stored in a second memory for comparison with the characters in the first. A control circuit makes the comparison by detecting a match between all characters in the first memory with those in the second memory and replaces the characters in the second memory with those in the first memory. If the number of characters in a later message differs from the number of those in a previous message, the later message is apparently not a retranmission of the previous one and must be stored into the memory as a different message. One disadvantage of the prior art is that the control circuit performs the character-by-character comparison even though such an apparently different message is received. Since the BCH code format employed in the paging system treats a group of successive characters as containing errors even if only one of them is in error. The prior art approach disregards such error-free characters, and hence two messages which are the same are likely to be interpreted as being distinct from each other. SUMMARY OF THE INVENTION It is therefore an object of the present invention to provide a method for distinguishing successively received messages with high efficiency and accuracy. In an embodiment to be described, a method is provided for distinguishing between successively arrived first and second messages each containing a series of characters. The method comprises receiving successively arrived messages and detecting an error in each character of each message to identify it as an error-containing character or error-free character. The first and second messages are stored into respective storage locations so that the characters of the first message positionally correspond with those of the second message. A first match is detected between the number of all characters contained in the first message and the number of all characters contained in the second message. A second match is detected between each of the error-free characters of the first message and each of positionally corresponding error-free characters of the second message. Comparison is then made between each of the error-free and error-containing characters of the first message and each of positionally corresponding characters of the second message and the result (match or mismatch) of each comparison is counted. Thus, comparisons are made between error-containing characters of the two messages. When the count of the results reaches a predetermined percentage of the number of all characters in each message, the first and second messages are interpreted as containing the same information. In this way, successively arrived messages can be identified with a high degree of accuracy. The message distinguishing method is advantageously incorporated in a selective calling radio display pager. The pager comprises means for receiving the first and second messages and a memory for storing the messages into positionally corresponding storage locations. A controller detects a first match between the number of all characters contained in the first message and the number of those contained in the second message and proceeds to detect a second match between each of the error-free characters of the first message and each of positionally corresponding error-free characters of the second message and further proceeds to compare between each of the error-free and error-containing characters of the first message and each of positionally corresponding characters of the second message. The controller counts the result of comparison and determines if the count reaches the predetermined percentage, and if so, it interprets that the later one of the messages is a retransmission of the previous one. The controller includes error correction means which replaces error-containing characters of one of the messages with positionally corresponding error-free characters of the other and provides a display of the character-replaced message. BRIEF DESCRIPTION OF THE DRAWINGS The present invention will be described in further detail with reference to the accompanying drawings, in which: Fig. 1 is a block diagram of a selective calling radio pager of the invention; Fig. 2 is an illustration of the format of data employed in the present invention; Figs. 3A and 3B are flow diagrams of programmed instructions performed by the controller of Fig. 1; Fig. 4 is an illustration of examples useful for describing the operation of the present invention; and Fig. 5 is an illustration of the program of the flow diagrams written by the C computer language. DETAILED DESCRIPTION In Fig. 1, a selective calling radio display pager is shown as comprising a front end 2 which amplifies and demodulates a paging signal detected by antenna 1 and shapes the waveform of the demodulated signal into a form sharply distinguishable by a decoder 3. Decoder 3 checks the identifiers contained in the paging signal with the pager's own address stored in a memory. If a match is detected, the decoder 3 applies a message signal that follows the identifier to a controller 4, which supplies a tone signal to a loudspeaker 5 to alert the pager's owner. The alarm is turned off when manually operated switch 6 is operated. The message signal is stored into a random access memory 7 for comparison with a subsequently received message signal. A liquid crystal display 8 is connected to the controller 4 to display the message stored in the memory 7. As shown in Fig. 2, the paging signal is transmitted in the format devised by the British Post Office Code Standardization Advisory Group (POCSAG) and adopted by CCIR as Radiopaging Code No. 1. A message signal is shown as a series of characters "ABCDE fghi" respectively stored in memory locations X1 through X10. Each of the characters is composed of 7 bits according to the ISO (International Standardization Organization) 646 code. The message signal is divided at 20-bit intervals into blocks each of which is combined with check bits and a parity bit to form a BCH (31, 21) code which is capable of correcting one error bit and of detecting a maximum of four bits in each code. If, for example, the character "A" is detected by decoder 3 as having two error bits, the first three characters "ABC" are treated as containing errors and the decoder 3 supplies an error flag to the controller 4 along with the characters. Random access memory 7 has at least two message storage areas A and B for storing the message of a later arrival and the same message of a previous arrival, respectively. In a manner described hereinbelow, controller 4 performs character-by-character comparison between the successively arrived messages to distinguish between them and replace error-containing characters of one of the messages with error-free characters of the other message if these messages are interpreted as being identical to each other, and displays the corrected message. Referring to Figs. 3A and. 3B, flow diagrams describing the error correcting operation of the controller 4 of the present invention are illustrated. In Fig. 3A, the program starts with operations block 101 which directs the counting of characters stored in the areas A and B to obtain N A and N B , respectively, representing the counts. Exit then is to decision block 102 which tests to see if N A = N B . If the answer is negative, control interprets that the later message is different from the previous one and exits the program, and if the answer is affirmative, control proceeds to operations block 103 which compares between error-free characters of the two messages. Exit then is to decision block 104 which determines whether there is a mismatch between any pair of the error-free characters of the two messages. If the answer is affirmative, control interprets that the later message is a different one and exits the program, and if the answer is negative, it advances to operations block 105 to compare between all characters of the two messages and detect mismatches N E . Control exits to decision block 106 which multiplies N A by a predetermined fraction ϑ, say 0.1 and compares it with N E . If N E is equal to or smaller than N A .ϑ, the later message is interpreted as being a retransmission of the previous message and if not, it is interpreted as being a different one. If the answer is affirmative in block 106, exit is to operations block 107, Fig. 3B, which directs the replacing of the error-containing characters of the later message with corresponding error-free characters of the previous message. If the corresponding characters of the previous message is in error, no replacement is made. Alternatively, the error-containing characters of the previous message may be replaced with corresponding error-free characters of the later message, as shown in operations block 108. The operation of the program will be visualized with reference to Fig. 4. If the previous message is as shown at B1 and the later message is shown at A having errors indicated by underlines, the latter will be treated by decision block 102 as not being a retransmission of the previous message B1. If the previous message has one error as shown at B2, a mismatch is detected by decision block 104 between the 12th characters which are not detected as being in error and therefore the message A is treated as not being the same as the previous one. If the earlier message has two errors as shown at B3 and no mismatches exist between error-free characters, control executes operations block 105 and detects three mismatches between the 3rd, 7th and 15th characters. Since N A =26, N E is greater than 0.1N A . Thus, the later message A is interpreted as being different from the previous one. If the previous message has one error as shown at B4 and no mismatches exist between error-free characters, control proceeds to block 105 as in the example above, but detects two mismatches in the 7th and 13th characters. Since N E is smaller than 0.1N A , the message A is treated as being a retransmission of the previous message B4, and control proceeds to block 107 where the 6th, 7th, 8th, 13th, 14th, 15th, 20th, 21st and 22nd characters of message A are replaced with corresponding error-free characters of message B4 as shown at A' with the 13th character of message A being left unchanged since the 13th character of message B4 contains an error ("%"). Alternatively, the 11th and 12th characters of message B4 may be replaced with error-free characters of message A as shown at B4' with the 13th character of message B4 being left unchanged. Fig. 5 is an illustration of a computer program written by the C programming language for executing the flow diagrams of Figs. 3A and 3B. Part (A) of Fig. 5 shows a sequence in which it determines whether the later message is a retransmission of the earlier one or not, and part (B) shows a sequence in which error-containing characters are replaced. In Fig. 5, the following arguments are used: message-A: matrix containing the characters of message A err-det-A: matrix containing an error-detecting flag of message A (err-det-A[n]=1 indicates that the n-th character of message A is in error, and err-det-A[n]=0 indicates that no error is detected in that character. Na: Number of characters contained in message A message-B: matrix containing characters of message B err-det-B: matrix containing an error-detecting flag of message A Nb: Number of characters contained in message B

Claims: A selective calling radio display pager including receiver means (2) for receiving a coded signal of error correcting format having an address and a corresponding message containing a series of characters; decoder means (3) for detecting an error in each of said characters of said received message, including means for identifying a group of successive characters as error-containing characters even if only one of the characters of the group is detected as being in error, and for producing a decoded message comprising error-free characters and error-containing characters; memory means (7) connected to said decoder means (3) for storing a first decoded message in a first memory and a second decoded message in a second memory; first comparing means (4, 101, 102) for comparing the number of the characters in the first memory with the number of characters in the second memory and for making a first decision if there is a match between said numbers; second comparing means (4, 103, 104) for comparing error-free characters in the first memory with positionally corresponding error-free characters in the second memory and for making a second decision if there is a match between all error-free characters of both memories; third comparing means (105, 106) for comparing all characters in the first memory with positionally corresponding characters in the second memory to detect mismatches and for making a third decision that both of the messages in the first and second memories are identical to each other if the number (N E ) of the detected mismatches is equal to or smaller than a prescribed percentage value (N A ϑ) of the number of characters in each of the memories; and replacement means (4, 107) for replacing the error containing characters in one of the first and second memories of memory means (7) with corresponding characters in the other memory when the first, second and third decisions are made by the first, second and third comparing means (4, 101, 102) (4, 103, 104) (105, 106). A selective calling radio display pager as claimed in claim 1, wherein said coded signal has the format of BCH (Bose-Chandhuri-Hocquenghem) error correcting codes.

Inventors: IDE MOTOKI C O NEC CORPORATION, SATO TOSHIFUMI C O NEC CORPORA, IDE, MOTOKI C/O NEC CORPORATION, SATO, TOSHIFUMI C/O NEC CORPORATION
Applicants: NIPPON ELECTRIC CO, NEC CORPORATION
Application year: 1988
Main classification: G08B3
IPC codes: H04Q7, G08B5, H04L1