DE2413903C2 - Method and circuit arrangement for determining the correspondence of a piece of information to be checked with one of several pieces of information - Google Patents

Description

State of the art, problem

Information processing facilities such as B. Control and evaluation devices of signaling, telecontrol and telephone exchanges need a to control incoming or outgoing character strings Functional group that checks the correctness, admissibility, non-admissibility or the need for implementation. The process flow for such the consensus Checks that provide given information are usually such that one in a Operating memory inserted complete character string via a comparison device of an or is juxtaposed with several other character strings firmly anchored in a control store. the end expenses derived from the comparison, such as "completely consistent, partly consistent, completely different or based on numerical values: equal, greater or smaller «, are used to control the further functional sequence forwarded to the corresponding switching devices.

If the character strings to be checked come from a large number of peripheral input devices that are due to their traffic importance in extreme cases almost simultaneously bring about an occupancy of the central facility can, then inevitably for each input device one must record the entire character string Storage share in the operational storage are provided. Usually this is still used for recording other information through certain memory share

40

45

50

55

60

65 one line must be expressible. The length of the line must be dimensioned in such a way that also - due to the type of information formation - the longest possible character string that can be combined to form an information chain finds its place in it. B. in telephone systems when carrying out a subscriber selection across several connection levels.

Since, in the latter case, there is one that controls the establishment of the connection from all subscriber stations Choice designated information giving is possible, must if from some of these places from only very specific Long-term goals are to be achieved, a facility must be available that supports the subscriber station related admissibility of the choice checked and the result of this check the further function process Such facilities are dependent, as the verification to block the transmission of elections can lead, generally known in specialist circles under the name »call number barring«. In older Institutions, the election control is carried out by checking follow-up drives during the voting breaks, in newer ones Facilities through z. B. Insertion of the first voting marks in a buffer and comparison of these characters with character strings specified as allowed or not allowed. The evaluation elimination is used in conjunction with one of the individual subscriber stations or a group of subscriber stations assigned authorization statement.

In many cases, in order to save storage space, it is sufficient to check the initial digits of the Election information. This space-saving restriction will be accepted especially when it is still out other operational reasons for each subscriber line a separate memory line is required. One of those reasons is with computer controlled Facilities z. B. the resignation of those submitted for internal traffic, usually from only dialing information consisting of a few digits and the information that is also to be evaluated as queryable information Identification of the current switching status.

Here it becomes evident that for the special purpose of election control, if the entire den Dialing information leaving the internal area should also be recorded, with a possible information length of E.g. 16 characters wasted unused and therefore expensive storage space in most operating cases would have to be. For the complete recording of the election information it must always come when from certain points only very specific long-term dialing targets, recognizable by the last digit, are achieved may be.

The problem of having to check the admissibility of the last digit as well or only can also occur with the pure data transmission occur. A form of organization is conceivable, such as B. one of many Entry points from possible stock status or position reports only with the announcement of the last or makes some special characters interspersed at certain points in the series of characters fully recognizable. All these cases can not be satisfactory with the previously known comparison method, i.e. with constantly fully used storage space can be solved.

It is known to check the presence of signals arriving one after the other by first checking incoming signals are temporarily stored and linked with the following signal. One

10

15th

20th

Such a circuit arrangement is specified in DE-AS 11 83 943. In each case, an incoming signal b is linked to the memory BMX set by the signal a that has already arrived and is held in a further memory BM 2. An output signal R is only emitted if all signals (a, b and c) have arrived in the correct order. However, this circuit arrangement is only suitable for recognizing simple signals (bits) on different lines and therefore cannot be used to compare series of pulses or dialing information in order to check the admissibility of telephone or telecommunication connections to be established.

Task, solution

The aim of the invention is to find a method with which by means of one input point only to a limited extent The available storage space can also be compared with control information, if the capacity of the receiving storage part is exceeded.

Based on a basic concept specified in the preamble of claim 1, the Solution to this problem with the measures mentioned in the characterizing part of claim 1 achieved. Here it is shown how a character string of any length running through a few memory locations through the automatic addition of ordinal symbols in the same subsequent intervals for comparison Findable groups of characters can be divided.

As the further claims note, these ordinal symbols can advantageously be combined with one in the Use the intermediate identifier to be included in the comparison if the comparison information in the control memory on the one hand have the same symbols at the same regulatory agency and on the other hand so chosen are that they make a clear statement about the information content of the character sequence in front of them give.

A particularly favorable functional sequence for the flow in of the now used for intermediate identification Ordinary sign results, as furthermore in the claim part for the circuit arrangement for Implementation of the procedure is listed if the storage locations in the control memory of this Characters are used as a source.

Of course, the intermediate identifiers are chosen so that unmistakable statements result and at an information branch for the one in front of the Ve ™ * cigur.gspunk! lying. A.ritei! in principle only storage space must be used once.

By linking, for example, those sitting in the operating memory, which are dependent on the comparison result The statement of admissibility and the intermediate identifier placed in the same memory can, if Subsequent characters may be left unheeded, a premature block blocking further characters Bring the test to a conclusion. If the early completion of the test is not achieved, an in the individual lines of the control memory, which is now used instead of the intermediate identifier occurs for the test completion. By choosing different characters, a statement can also be made about the direction of evaluation (e.g. positive or negative, permissible or not permissible) of the preceding Comparison information can be made.

Process application, exemplary embodiment

To clarify the features according to the invention, a method that follows the method is now intended Functional sequence are described using a block diagram and a few tables. It shows

F i g. 1 the block diagram,

F i g. 2 and 3 a character run and

F i g. 4 the meaning of the intermediate identifiers.

In the block diagram of FIG. 1, four character input locations A 1 to An are indicated. The character strings j 1 to Jn in brackets should be given via these points as information both for controlling the internal connection unit VE for the purpose of reaching a near target yVZ and for controlling other external switching devices that are not shown separately and connecting with a long-term target FZ. In the last part of the information there can be a data statement that no longer controls the establishment of the connection.

Accordingly, the whole complex can be used for a telephone exchange, a data processing device, a control device or any other monitoring device serving any purpose and view reporting facility. As information in the sense of this presentation is therefore not a possibly the language to be transmitted, but only the sequence of defined in their individual meaning Understand signs.

For operational reasons, where transmission over long distances z. B in application to the establishment of a connection in telephone networks, financial issues play a major role, in the present case only very specific information should be given from very specific character entry points. Checking this is the task of the functional units consisting essentially of the operating memory BS, the control memory KS and the comparator VG. The demultiplexers DEi and DE 2 controlling the memory lines BZ 1 to BZn and KZX to KZn serve to interconnect them, as well as the multiplexers MUX and MU 2 for selecting the character groups C 1 to G 6 to be checked and transmitting the intermediate identifiers Assemblies are named at the given time.

It should be mentioned in advance that the information / 1 is a short information item that is only used for internal purposes and is formed without a special identifier, e.g. B. for the control of a short-range destination NZ, the information / 2 and / 3 with introductory identifiers for controlling long-distance destinations FZ and the information Jn also with an introductory but special identifier for controlling a data terminal and information storage there.

The example presented here is intended to be a computer-controlled connecting and receiving device. For this reason, a memory line 5Zl to BZn is assigned to each character delivery point A 1 to An either in a fixed allocation or only with connection assignment in an assigned allocation the assigned authorization area for entering information can be seen.
• The fixed content therefore also includes the

Line assignment transmitted identification and authorization data of the connection. In practice, the individual lines are continuously scanned for their content in rapid succession by a device which is assumed to be known to the relevant experts. Such a scan is indicated in the present example. The time sequence of the individual switching processes is determined by the clock generators ITC and 2TC , which alternate with one another. The clock generator 1 TG outputs the clocks TIl to T16, the clock generator 2 TG the clocks T21 to T26.

The clock time segment TI1 emitted here by the clock generator 1 TG serves as a reference time segment for repetitive switching processes. With it, the flip-flops FF1 and FF2 are switched to their rest position. However, the switching processes are only completed after the connection has been assigned by at least one of the character delivery points A 1 to An and, in this example, an information delivery containing at least three characters, with the restriction that the first character must be an identifier.

If this is not the case, as is the case with the information output / 1 consisting of the three digit characters 4, 3, 5 by the character output point A 1, then - in anticipation of the further description - the switching conditions necessary for starting the character comparison and the group setting for the switching units FG and EM are not fulfilled. In the case of EM , the receipt of setting information derived from an identifier or order symbol for the multiplexers MU 1 and MU2 controlling the control memory KS is assumed, and in the case of FG, the existence of an AND condition is assumed. The AND condition requires the presence of a filling different from a space in places 52 and S3 and the storage of an identifier O or D or T in place 51 .

Since the information / 2 with the character sequence 026612341 submitted by the character delivery point A 2 fulfills this requirement, the description of the hamlet is based on an occupancy of the facility by this character delivery point; it becomes effective with the cycle time T12 which opens the connection unit AS to the operating memory BS.

In the present example, each character delivery point Λ 1 is a separate memory line Bzl BZn to permanently assigned to An, the operation memory BS. Only what is essential for the functional sequence to be shown is shown at the storage locations; they are fixed by the column information 51, 52, 53 and SB. SB contains, with B1 to Bn, the characteristic data influencing the evaluation of the information provided, which are to be regarded as unchangeable.

From the initially free spaces 51, 52, S3 is used the place 51 for receiving only the first character of the given information, after occupying the rest Places 52 and 53 through the subsequent characters are left out for all further characters from the character delivery points given characters blocked. His task is now that of the character comparison from the facility to include the issued intermediate or final identifier. The type of filling of the storage spaces is in this case, it is insignificant, it can be used in direct control of the individual space or as with one Shift registers for all characters entered in the line take place in place 53. For viewing the The only decisive factor in the functional sequence is the space that is finally reached when the group of characters is full.

During a measure line T12, only one character can ever be stored. To fill all three storage spaces for the first time, a three-cycle cycle is necessary. The cycle throughputs are so fast, however, that a complete functional process enabling the character comparison can take place in the time span between two character input times. In the cycle times T13 following the cycle times T12, the demultiplexer DEi, which switches through the individual operating memory lines one after the other to the functional units FG, FM and AE , is advanced by one setting in each case. If a setting has now been reached in which - as in the case of the storage of the character string 026 in line BZ2 - a signal influencing the setting marking unit EM can be derived from location 51 after the line switching with clock T14 after the presence of the following act T15, then arise the multiplexers MU \ and MU2 on the group columns G 1 to G 6 of the control memory KS identified by the stored code number.

With the code numbers O. D and T, a connection preparation for the first three columns to the comparator VG is encountered via MU1 and one for the identifier column of the following group (in this evaluation stage considered here, group C 2) for the evaluation unit.

The clock T16, which closes the cycle of the clock 1 TG , now sets the clock generator 2 TG, which is still pending at the clock position T26, into circulation via the running gate \ LG , provided that the switching unit FG has determined the filling condition for the storage spaces. In the jump to the clock position T21, the clock generator 1 TG operating with the clock position T16 with a slight switching delay is stopped.

Clock T22 switches on the demultiplexer DE 2 , which has the basic switching position when the clock generator 2TG starts up, to the first setting that interrogates the control memory line KZi. Clock T23 makes the setting effective so that the character string 026 stored in group G i can reach the comparator VG. The comparison is carried out with cycle T24 and the result is transferred to the evaluation unit.

Cycle T25 releases the evaluation carried out on the switching unit VE , taking into account the evaluation influencing coming from the operating memory column SB. Subsequently, during the same clock position, the character storage locations 51, 52 and 53 in the operating memory 55 are cleared by setting spaces and the intermediate identifier A visible from the fourth column of the control memory KS is written into the column SI .

The clock T26, which has been somewhat stretched in time , has no effect as long as the demultiplexer DE2 has not reached its rest position in cyclical further switching, so that a renewed clock cycle T21 to T26 can take place. The same switching operations take place here as before, the only difference being that a further line of the control memory KS is queried with each new cycle. Since an interrogation of all lines of the control memory is carried out for each operating memory line and in the present case the first interrogation already yielded a positive result, in this arrangement, which is a simple example, all further lines are now

run through the missing AND condition for the switching unit FG without comparison until the basic position is reached. If the latter is reached, the flip-flop FFS receives its reset pulse at cycle Γ23 via FF3.

In this switching position, the up to then ineffective clock Γ26 can now also control the flip-flop FF 4 to its rest position and thus bring the clock generator 1 TG, which was temporarily shut down with clock position Π 6, to run again. By leaving the clock position Γ16, the activation excitation for the clock generator 2 TG ceases, so that it stops with the clock position 726.

The clock sequence TlI to T16 now emitted by the clock generator 1 TG leads to a new line control for the operating memory BS and then with a renewed start-up of the clock generator 2TG to query the control memory KS with the group setting given by the identifier found. If the last group - group G4 for the information / 2 - was found, then after the query locations of the operating memory line had been empty, only the end character Z was written and the comparison result was stored, which is now used by other querying switching units (not shown) for the purposes of the application the facility can be evaluated.

If there is no positive comparison result, then when the basic position of the demultiplexer DE 2 is reached, a final character expressing this is taken from the character set stored in the final character memory ZS. The same also happens if - due to the admissibility statement SB flowing into AE - an early end of the examination is brought about.

FIG. 2 shows a character string storage taking place with an ongoing comparison by the character delivery point A 3 which emits the information / 3.

As can be seen from FIG. 1, this information is stored as comparison information in line KZ3 of the control memory KS. The inserted intermediate identifiers H, K, L and M as well as the final character Z complete the respective character group.

In Fig. 3 is the timing of two lists for data transmission intended strings One string is initiated with the identifier D, the other with the identifier T. Since it is only possible to establish a match of a character including the identifier in the fifth and eighth positions, the character strings stored in the control memory lines KZn and KZ 6 have a character in the other positions not used for the identification, marked with the symbol Y general meaning. The area of the general can be determined according to the needs. So z. B. Y with the Zil'fernzeichen 1 to 8, however, 0 and 9 are not kept comparable.

ίο F i g. Finally, 4 gives a table that shows how meaningful intermediate identifiers can be selected. So z. B. the identifier K, the identifier dog, the character string 11 immediately behind this identifier. The intermediate identifier H can in turn be equated with the character string 006. The other equations are clearly shown in the table.

Referring back to Fig. 1 should also be mentioned that. such as B. in the control memory lines KZ3 and KZ 4, several starting groups can be of the same type. As a result of the release of the storage spaces S2 and S3 following the first positive comparison result, the AND condition for the functional unit FG , which enables a further comparison, has been removed. Not shown, but achievable by means known to those skilled in the art, is the immediate resetting of the demultiplexer DE 2 into its basic position. The continuation condition for the clock generator TTG , which does not take this into account, is indicated by the inserted OR gate 2LC.

A character string is stored in line KZ5 , which can be entered from any of the input positions, but is not listed in the example. KZA shows a branch with the same character beginning.

To use the method it should be noted that with this method in a telephone exchange center In the figurative sense, each subscriber line can be assigned its own locking mechanism without great effort.

Of course, in a departure from the example chosen, with a correspondingly modified functional relationship, a comparison between the character strings brought into the operating memory BS and the character strings stored in the control memory KS can also be started when a single character is output, if the significance of the character to be checked can be fixed by the corresponding addition of ordinal characters

For this purpose 2 sheets of drawings

Claims (24)

Patent claims: 1. A method for determining the correspondence of a part or the entirety of a self-contained character sequence representing information with one or more items of comparison information, as well as a signaling characterizing the comparison result, the character sequence to be checked being stored in memory locations provided for this purpose in a line of an operating memory assigned to the individual character output point and each comparison information is stored in a special line of a control memory, characterized in that the character strings to be checked, possible in different lengths (/ 2/02661 ...), are the limited number, preferably adapted to the shortest information, for recording specific memory locations (BS / SX, 52, 53) in a group formation recognizable by flowing ordinal symbols (A, B, C) and each recognizable group is compared to the correspondingly ordered groups of the comparison information (KS / KZi) will be presented. 2. The method according to claim 1, characterized in that the order of the individual characters of the comparison information (KS / KZi) is given by order characters (A, B, Ο permanently inserted there). 3. The method according to claims 1 and 2, characterized in that the ordinal symbols (A, B, Qm are included in the comparison. 4. The method according to claims 1 -3, characterized in that the ordinal symbols (A, B, C, E, F, G, H ...) are selected to enable an intermediate identifier so that the entire information content or the character sequence in front of them can be clearly determined from them, even if several pieces of comparative information (KS / KZX to KZn) are available . 5. The method according to claim 1, characterized in that the end of the test for the test Character sequence (/ 2) can be seen from an additional trailing character (Z ^. 6. The method according to claim 5, characterized in that at tarnished as compared frühester time for adding the final character (Z) of the result of flown without comparison with the respective first group (GX) of all the control information (KS) is selected. 7. The method according to claim 5, characterized in that when the comparison has started, the completion of the comparison with the last group (G 6) of a control information item (KS) found is selected as the latest point in time for adding the final character (Z). 8. The method according to claim 5, characterized in that the premature termination of a comparison, marked by an additional final character (Z) , and the evaluation of the comparison result from one of the individual character delivery points (A 1 to An) can be seen from differently added characteristic data (B 2 ) or the admissibility statement contained therein is held dependent. 9. The method according to claims 5 and 7, characterized in that the character strings stored in a control memory (KS) as comparison information (KS 1 to KSn) are terminated by a permanently appended final character (Z) . 10. The method according to claim 9, characterized in that the comparison information. (KSl to KSn) firmly attached final characters (Z, S) determine the meaningfulness of the individual comparative information (e.g. permissible or not permissible) 11. The method according to claims 1-4, characterized in that the order symbols (A B, C, E, FG, H ...) flowing into the zj checking information (] 2 -Jn) are derived from the order symbols added to the comparison information will. 12. The method according to claims 5 and 7, characterized in that the information to be checked (J2-Jn) terminating characters (Z, S) when a comparison information is found for the case of a comparison carried out up to the last group of that of the respective comparison information added closing characters can be derived. 13. The method according to claim 1, characterized in that the passage of the storage locations (S5 / 51, 52, 53) provided for receiving the information to be checked (/ 2) only takes place if the information to be checked has an identifier to be assigned to the information (O) is initiated. 14. The method according to claim 13, characterized in that the information introducing identifiers (O, D, T) give a statement about the type of information and can be found again as part of the comparison information (KZ 1 to KZn) stored in the control memory (K, S) . 15. Circuit arrangement for carrying out the method according to claims 1-14, characterized in that the portion (BZX to BZn) of the operating memory (BS) mW determined in each case for receiving the information to be checked (JX to Jn). fewer, but at least two storage spaces (51, 52, 53) than is generally necessary to store the entire character string. 16. A circuit arrangement according to claim 15, characterized in that at least one of the character storage spaces ( 51), always the same for receiving an identifier (O, D, T) , which is also made up of characters, and the incoming intermediate identifiers ( A, B, C ... a, b, c.) As well as the final character (ZS) 17. Circuit arrangement according to claim 15, characterized in that for the final Acceptance of the storage spaces provided for by all identifiers, which are bare of all identifiers (52, 53) must first be filled with a space after each group pass. 18. Circuit arrangement according to claim 15, characterized in that the filling of at least one storage space (52, 53) with an information symbol takes place in a period of time which is kept free from group comparison by clock generators (TG 1, TG 2). 19. Circuit arrangement according to claim 15, characterized in that each individual group comparison is kept dependent on the filling of all storage spaces (FG) of the operating memory (BS). 20. Circuit arrangement according to Claim 15, characterized in that the group setting (G 1 to G6) of the multiplexers (MUi, MU2) provided for the column control of the control memory (KS ) is derived from the identifier (51) written in the operating memory (BS). 21. Circuit arrangement according to claim 15, characterized in that the group setting of the multiplexer (MU2) provided for deriving the identifier and trailing character (A, B, C ... Z) compared to the group setting of the multiplexer (MU 1) setting itself to the comparison characters advances one setting level 2Z circuit arrangement according to claim 15, characterized in that the storage spaces in the control memory (KS) for the order and closing characters (A, B, C, ... a, b, c, ... S, Z) of the comparison information as a source are used for the intermediate identifiers (A, B, C ...) to be set in the operating memory locations (51), which enable the continuous character comparison, and also for the respective final identifier (Z, S) when the comparison has been completed. 23. Circuit arrangement according to claim 15, characterized in that the number of character storage spaces (S 1 to 53) provided in the individual operating memory lines (BZ \ to BZn) are selected so that they are used for special operational purposes without an introductory identifier (O, D, T) can always fully accept character strings of the same length. 24. Circuit arrangement according to claim 15, characterized in that the character strings stored in the control memory (KS) can contain characters with an ambiguous statement f ^.