KR20010006526A - Connection time free data messaging through telephone networks - Google Patents

Abstract

A method for communicating between a caller and a recipient via telephone networks including the following steps: the caller placing a call from a caller telephone line to a recipient telephone line, the recipient receiving but not answering the call and as a result a code is communicated between the caller and the recipient. There follows the step of determining a meassage from the communicated code.

Description

CONNECTION TIME FREE DATA MESSAGING THROUGH TELEPHONE NETWORKS}

For example, trucking, courier, and delivery services may receive orders from one side and some dispatchers and some to update dispatchers for their location and service behavior on the other side. It is required to maintain a form of communication channel. For example, static services, such as vending machines, may require similar communication channels.

Such a communication channel can be realized, for example, using wired and cellular wireless communication equipment and pagers, which are existing telephone networks. Customized pagers are particularly popular. This pager uses short messaging triggers that are compressed such that each message corresponds to a given short code. In the case of mobile equipment, equipment that is monitored very quickly, such as a vehicle, or in the case of fixed equipment, a service with a vending machine can reduce data communication costs by using a pager on demand. However, these communication costs are merely reduced and not lost. Similarly, telephone messages can be coded, but this also merely reduces and does not eliminate connection time costs.

Glossary of Terms

In the specification and claims herein, the following terms will be used, some of which are conventional in meaning and others which are synonymous.

IN-Intelligent Network-Creates a "ring" at a so-called station, in accordance with a predetermined protocol that allows intelligent call filtering at least according to its source (caller) and its target (receiver). Thus, a telephone network, landline, or cellular based on an intelligent network switch that performs signaling.

CN-Conventional Network-Telephone network, landline, or cellular that does not include the exchange's intelligent network signaling.

To call-to communicate with or attempt to communicate by telephone

Caller-the communicating party that originated the call

Beginning-of-Call-the earliest event by which the receiver detects the call

Clock trigger-A signal during call progress that is taken as a reference point for the duration of the call. For example, any “ring” as well as the initiation of a call as defined above can be used as the clock trigger.

Receiver, Receiver-Called party

Message Code (MSC)-A code that specifies the content of a particular message in detail (when decoding).

Message-any form of information, including but not limited to commands, data, any necessary word and / or number combination

Caller Identity Code (IDC)-A code that specifies the source of the message in sufficient detail.

Message Arrival Time (MAT)-The time when the receiver starts receiving the message.

Message Time of Relevance (MTR)-The retrieval time of the message data. That is, the time at which the reported event occurred

Identified Message (IDM)-Combination of IDC and MSC

Acknowledgment (ACKnowledge: ACK)-Correct acknowledgment by message recipient

Not ACKnowledge (NACK)-Receive side signal for error in message reception

Partial ACKnowledge (PACK)-Receive side signal for a correctly received but incomplete message

Active Messaging Party (AMP)-part of a communication procedure with the ability to call another party for sending or receiving data

Passive Messaging Party (PAP)-part of a communication procedure that receives and decodes a message and prepares the message for AMP polling, but does not call the other side.

Registration (REGistration)-A signal sent by the AMP to any receiver that means "I am the current communication party and your response or message should be addressed to me and only to me."

Modem or Line Interface (MLI)-Receives and transmits calls and creates a "ring" to switch the appropriately given line response tone from "free" to "busy" and vice versa. Letting electronic board

Busy / Free tone generator (B / FTG)-A module, hardware, and / or software capable of instructing a line to transition from a "free" state to a "busy" state and vice versa. For any form of MLI, B / FTG can be a pure software module.

Polling (POL)-A procedure operated by an AMP that receives a message even if the other side should not generate a single call.

Line-An abbreviation for cellular or terrestrial "telephone line", each line associated with a telephone number

Line index-A number representing a telephone line. Therefore, the line index also corresponds to the telephone number associated with the telephone line.

Time-Out-The predetermined time allotted to the caller for transmitting the elements of the message code. If the time-out is exceeded, the message coding (encoding by transmitter, decoding by receiver) procedure ends.

Time-out procedure-procedure for ending processing after the time-out has elapsed

<Summary of invention>

It is an object of the present invention to provide a method and system for communication between two or more communication sides using a telephone network in which connection time costs are substantially and completely eliminated.

The telephone network may be a landline or cellular, and the caller's delivery of the call to the recipient may be through a fixed medium, including satellites.

In particular, the present invention belongs to code communication between two communication sides. This code will generally be a caller identification code identifying the caller, or a message code representing the message. Terms such as code transmission and code transmission will also be used. However, according to the present invention, it is clear that the caller can never respond.

In the understanding of generally accepted terms, no message code is transmitted. That is, the stream of bits containing the message is actually sent from the caller along the line to the receiver, not requiring the receiver to answer the call to receive the message.

According to the present invention, a method for communication between a caller and a receiver through a telephone network,

(a) the caller originating at least one call from the at least one caller phone line to the at least one recipient phone line;

(b) the code is passed between the caller and the receiver by the receiver receiving at least one call but not responding; And

(c) determining the message from the passed code

It includes.

According to a first aspect of the invention, the codes are conveyed by recipient noting, where the recipient's telephone line is called and, if more than one line is called, they follow the order in which they are called.

According to a second aspect of the invention, the code is conveyed by the called party from the calling telephone line generating the at least one call and, if more than one call is generated, follows the order in which the calls were generated.

According to a third aspect of the invention, the code is conveyed by a receiver preparing at least one receiver telephone line in a given state, wherein the caller notes the state of the at least one prepared receiver telephone line.

In general, the given state of the recipient telephone line is selected from the group comprising the busy and free states.

According to one embodiment, at least one call is received at a first time value and the code is conveyed by the recipient short-circuit with the elapsed time between the receiver phone line and the disconnection.

According to another embodiment, at least one call is received at a first time value, and a code for notifying which caller's phone line is made from which caller's phone line, together with the elapsed time between the first time value and the disconnection, is communicated by the receiver. do.

Preferably, the first time value is the time at which the clock trigger of the call occurs.

Preferably, the telephone network is an intelligent network.

Alternatively, the telephone network is a conventional network.

For an intelligent network, the network provides a caller identification code that can be automatically transmitted in the communication signal transmitted through the telephone network when the caller calls, and can be automatically decoded from the communication signal.

For a typical network, the caller, if desired, also provides a caller identification code provided by the caller call receiving phone line indicating the caller identification code.

According to the present invention, there is also provided a communication method using a telephone network, wherein a telephone call is generated but not answered, and the method includes the following steps.

The caller makes at least one telephone call so that at least one telephone line is called;

The recipient does not answer the call and receives at least one telephone call; And

Associating at least one caller of the caller to the telephone number that is called but not responding to the recipient with a predetermined code, the code indicating an identification message.

According to the present invention, there is provided a communication method using a telephone network, wherein a telephone call is generated but not answered, and the method includes the following steps.

The caller makes at least one telephone call, and at least one telephone number is transmitted;

Receiving at least one telephone number in response to the transmitted at least one telephone number without responding to the requested at least one telephone call; And

Associating the received at least one caller phone number with a predetermined code indicating an identification message.

According to the present invention, there is also provided a communication method using a telephone network, where a telephone call is generated but not answered, the telephone line state determines authentication for the continuation of the communication method, and if the telephone line state is an "authentication-continuous" state If authenticating, the method includes the following steps.

The active caller calls at least one unanswered telephone call upon receipt of an " authenticated-persistent " state to the at least one called telephone line;

The active caller calls at least one unanswered series of telephone calls to at least one called line; And

Notifying the telephone line status of at least one unresponsive series of telephone calls, thereby obtaining a series of statuses indicating a message code, the code indicating an identification message.

In addition, according to the present invention, there is provided a communication method utilizing an existing telephone network, wherein a telephone call is generated but not answered, and the code of the message coded with the call line number from the first time value until the call disconnection- As generating the element, the method comprises the following steps.

The caller makes at least one telephone call, wherein the at least one telephone line is called but not answered;

Receiving at least one telephone call without answering the call by the called party, notifying the time from the first time value until the call is disconnected; And

Associating at least one caller of the caller to a telephone number that is called but not responding to the recipient, with a time notified from the first time value until disconnected, with a predetermined code, the code indicates an identification message. do.

Further according to the present invention, there is provided a communication method using a telephone network, wherein a telephone call is generated but not answered, generating a code-element of a time-coded message from a first time value until the call break with the call line number. As such, the method includes the following steps.

At least one telephone line being called by the caller making at least one telephone call;

Receiving a at least one telephone number in response to the transmitted at least one telephone number, not responding to the requested at least one telephone call, and notifying the time in the first time until the call break; And

Associating at least one caller's telephone number with a predetermined code, the code indicates an identification message, together with the time notified from the first time until disconnection.

Preferably, the first time value is the time at which the clock trigger of the call occurs.

According to the present invention, there is provided a system for communicating between a caller and a receiver through a telephone network.

(a) means for the caller to request at least one call from at least one caller's phone line to at least one recipient's phone line;

(b) means by which the receiver receives at least one call but does not answer, such that the code is communicated between the caller and the receiver;

(c) means for determining a message from a communication code

It includes.

According to a first aspect of the invention, a code is communicated by the receiver informing which recipient telephone line is called and in what order when one or more lines are called.

According to a second aspect of the present invention, a code is communicated by the receiver informing the recipient of which telephone line at least one call is made, and in what order when the at least one call is made.

According to a third aspect of the invention, a code is communicated by a receiver providing at least one receiver telephone line in a predetermined state, and the caller notifies the state of the at least one provided receiver telephone line.

In general, the predetermined state of the receiver telephone line is selected from a busy state and a free state.

According to one embodiment, at least one call is received at a first time value and a code is communicated by the receiver for notifying which recipient telephone line is called with the elapsed time between the first time value and the disconnect.

According to another embodiment, at least one call is received at a first time value and, with the elapsed time between the first time value and the disconnection, a code for notifying at which caller's phone line at least one call is made is received by the receiver. Is communicated.

Preferably, the first time value is the time at which the clock trigger of the call occurs.

Preferably, the telephone network is an intelligent network.

Alternatively, the telephone network may be a conventional network.

For an intelligent network, the network provides a caller identification code that can be automatically transmitted in the communication signal transmitted through the telephone network when the caller calls, and can be automatically decoded from the communication signal.

For a typical network, the caller, if desired, also provides a caller identification code provided by the caller call receiving phone line indicating the caller identification code.

According to the present invention, there is provided a communication system using a telephone network, wherein a telephone call is generated but not answered, and the system includes the following means.

Means for the caller to request at least one telephone call so that the at least one telephone line is called;

Means for receiving at least one telephone call while the called party does not answer the call; And

Means for associating at least one caller of the caller with a called party who does not respond to the telephone number for the provided code, wherein the code represents the identified message.

In addition, according to the present invention, in a communication system using a telephone network, but does not answer even if there is a telephone call,

Means for providing at least one telephone call by the caller to transmit at least one telephone number;

Means for receiving at least one telephone number by a recipient in response to the transmitted at least one telephone number without responding to the provided at least one telephone call; And

Means for associating the received at least one caller phone number with a predetermined code indicating an identification message

There is provided a communication system comprising a.

Further, according to the present invention, a communication system that uses a telephone network but does not answer even when there is a telephone call, determines the permission of the continuation of communication by the state of the telephone line, and provides the authorization when the state of the telephone line is in the "permit permission" state. To

Means for providing at least one passive caller telephone line with at least one unanswered telephone call by the active caller upon receiving a "permit authorization" status;

Means for providing a series of at least one unanswered telephone call by the active caller to the at least one passive caller telephone line; And

Means for detecting a telephone line condition of said at least one unanswered telephone call and obtaining a series of status indicative of a message code indicating an identification message;

There is provided a communication system comprising a.

Further, according to the present invention, a communication using an existing telephone network, which does not answer even when there is a telephone call, generates a code element of a message coded by the time and call telephone line number at the first time value until the call is disconnected. In the system,

Means for providing at least one telephone call by the caller to call but not answer at least one telephone line;

Means for receiving at least one telephone call without answering the call by a receiver, and detecting a time from the first time value until the call is disconnected; And

Associating a telephone number called by the at least one call from the caller to the recipient but not answered, and the time detected until the call is disconnected at the first time value with a predetermined code indicating an identification message. Means for

There is provided a communication system comprising a.

Further, according to the present invention, a communication system using a telephone network, wherein a telephone call is provided but not answered, generates a code element of a message coded by the time and call telephone line number from the first time value until the call is disconnected. To

Means for providing at least one telephone call by the caller to call at least one telephone line;

Receive the at least one telephone number by the receiver in response to the transmitted at least one telephone number, without responding to the provided at least one telephone call, and determine the time until the call is disconnected at the first time value. Means for sensing; And

Means for associating the received at least one caller phone number and the time from the first time value until the call is disconnected with a predetermined code representing an identification message

There is provided a communication system comprising a.

Preferably, the first time value is a time at which the clock trigger of the call occurs.

In the system of the present invention, the active messaging side is used to transmit the message code, and the passive messaging side is used to receive the message code and prepare the message code for polling.

In the system of the invention, a device is used which requires status reporting of at least one device status. An example of such a device is an automatic point of service (POS) system, which includes at least one of the types and quantities of inventory and services required for an automated POS system, as well as a faulty automatic POS system for repair. And a status report selected from the fault. Another representative device is a manual POS system, which requires a status report selected from at least one of the types and quantities of inventory and services required for the manual POS system and defects and failures of the manual POS system required for repair.

In the system of the invention, a device is also used which requires a status report of the value read from the device. Such a representative device is a utility meter.

In addition, in the system according to the present invention, device instructions for applying to a device having a predetermined state are used. This device command causes a change in the predetermined state. This representative device command is a controller command for application to a device having a predetermined state. Controller commands cause changes in certain states and devices. Representative examples of such devices are eg water valves, traffic lights, current switches and smart house controllers.

Today, the ID or line number of a given public telephone network subscriber is based on a certain number of ordered digits. The number of digits in these IDs depends, in particular, on the total number of network subscribers and the expected growth rate. The network operator with the subscriber tries to keep the line number as short as possible. However, it is customary to increase the number of different combinations of line numbers at least tens of times larger than the actual number of subscribers in order to provide room for growth of the subscriber population. Nevertheless, many operators believe that their infrastructure should be able to support major changes in the numbering system, such as adding one digit to the current line number in order to provide room for increased subscriber number size. . As a result, today's infrastructure supporting most intelligent networks, especially digital networks, can instantly turn any given number of digits into a new one with one more character, and the IDC combined with the new number will automatically have extra digits. Will be sent to the receiver. In the present invention, the location storing the caller ID (IDC) associated with the called ID and having an additional blank space is referred to as an "extended identification code" (EIC). EIC stands for Caller Phone Number (CEIC) or Receiver Phone Number (REIC).

Therefore, according to another feature of the present invention (hereinafter referred to as an "extended encoding feature"), the current unused portion of the EIC in the intelligent network can be called without increasing the number of lines allocated to transmit the extended message set. Used to increase the list of messages sent between the receiver and the receiver. According to one embodiment of the invention, at least one character or other value (which constitutes a code element of the code portion) remaining in the currently unused portion of the CEIC field (hereinafter referred to as "least significant portion (LSP)") This IDC unit is added to increase the number of messages that can be transmitted.

For example, consider one line connecting the caller and the receiver, and one free location (which makes up the LSP) that can have 0-9 as values representing ten different messages. If the sender adds a value from 0 to 9 (depending on the desired message to be sent) to the IDC, the telephone exchange passes the code element through the intelligent network and routes the call from the call side to the receiver. The appropriate device at the receiver end accesses this particular location and extracts the value stored therein. This message is easily decrypted by querying the lookup table. By this approach, a so-called "many to one" infrastructure is emulated using only one physical line.

The main advantage of the proposed configuration is its simplicity. The intelligent switching network only refers to the MSP, and the remaining task is to access the dedicated device or module, extract the appropriate LSP and decrypt the desired message from it.

While the LSP is added to IDC and described the proposed extended coded message for one telephone line, those skilled in the art will appreciate that this is only one of various possible variations. Thus, if there is an available part of the specification that penetrates into the intelligent network, then the LSP added to the recipient phone number (which constitutes the REIC) of the call may be another code element. Of course, if the free position in the EIC is x and the LSP constitutes position y (y ≦ x), then the LSP may be at any position y within the available position x.

As such, in the broadest aspect, the message code includes MSP + LSP each if the MSP indicates one or both of the caller and the recipient's telephone number and the LSP is configured by one or more free locations. It may include at least one of the continuous elements. If there is a device that the code can be decrypted, i.e. extracted and decrypted, that is to say to get the desired message from it, then each location can have a number or a different code. Also, as described above, the elapsed time between the first time and the discontinuity may constitute another element of the code portion to further increase the list of possible messages sent from the caller to the recipient. As will be described below, the order of the elements may preferably have meaning for encoding messages. This configuration allows one or more telephone lines of the call telephone line to constitute one code element (or code elements), or one or more telephone lines of the incoming telephone lines may constitute one code element (or code elements). It is desirable to be able to apply to more than one line, so that the number of messages can be increased significantly without the need to expand the associated infrastructure.

As such, in the context of the present invention, message encoding is at least one code having an LSP with other or different types of code parts, such as specified or ringing times, call telephone lines, incoming telephone lines, and others as needed or appropriately required. It can be used in addition to a piece of code consisting of elements.

As such, the present invention provides a method for transmitting a coded message selected from at least one message set in an intelligent telephone network from at least one call side telephone line to at least one receiving side telephone line.

(a) at the call side, encoding the message to include at least one code portion that transmits to the intelligent telephone network;

(b) routing the encoded message by at least one call from at least one of the call side telephone lines to at least one of the receiving side telephone lines; And

(c) at the receiving end, receiving at least one call and decrypting the encoded message therefrom without answering the call;

It includes.

The present invention also provides a system for transmitting a coded message selected from at least one message set in an intelligent telephone network from at least one call side telephone line to at least one receiving side telephone line.

(a) at the call side, an encoder for encoding the message to include at least one code portion that transmits to the intelligent telephone network;

(b) a router for routing the encoded message by at least one call from at least one of the call side telephone lines to at least one of the receiving side telephone lines; And

(c) a receiver for receiving at least one call and decoding the encoded message therefrom without answering

It includes.

In addition, the present invention is for use in a particular type of system, the system is

At the call side, an encoder for encoding the message to include at least one code portion passing through to the intelligent telephone network; And

A router for routing the encoded message by at least one call from at least one of the call side telephone lines to at least one of the receiving side telephone lines.

It includes.

In addition, the present invention is for use in a particular type of system, the system is

At the receiving side, a receiver for receiving at least one call and decoding the encoded message therefrom without responding to it.

It includes.

It should be understood that any criterion of "time t" for time interval "Δt" should be constructed in the context of the description and claims, including substantially t and Δt. Thus, as various examples, with reference to the following "the first time value is the time at which the clock trigger of the call occurred", it also includes a situation in which the first time is earlier or delayed by [Delta] t with respect to the clock trigger event. As another various example, for example, "the elapsed time between the first time t ₁ value and the discontinuity t ₂ is not comprised solely of t ₂ -t ₁ , and Δt 'and Δt are necessarily the same. And t ₂ ± Δt'-t ₁ ± Δt ".

The description and claims are not limited to the specific examples provided in the detailed description with reference to the " plus means " function, but any hardware and / or software implementation originally known for realizing the function is further provided. It should also be noted that it includes.

As can be readily seen from the description and the claims, the present invention utilizes the concept that message transmission does not incur costs, while one of ordinary skill in the art will appreciate that the systems and methods of the present invention are costly transactions. It will be readily appreciated that it can be used in connection with.

The present invention relates to the field of data communication over landline or cellular telephone networks.

For a better understanding, the invention will now be described by way of example only with reference to the accompanying drawings.

1 is a block diagram of a communication scenario for data communication between two parts.

2 is a block diagram of an exemplary communication scenario in which data is communicated between an operations center and multiple operating points.

3 is a block diagram illustrating a caller in communication with a receiver over a telephone network.

4 is a flow chart illustrating the main steps of the method of the present invention in accordance with the broader features of the present invention.

5 is a block diagram generally illustrating a module of an active messaging unit according to a preferred embodiment of the present invention.

6 is a block diagram generally showing a module of a passive messaging unit according to an embodiment of the invention.

FIG. 7 is a flowchart illustrating the main steps for decoding caller identification code by a receiver using intelligent or conventional network operation.

FIG. 8 is a flow chart illustrating the main steps for caller identification code encoding by exhaler using intelligent or conventional network operation. FIG.

9 is a flowchart illustrating the main steps of receiver logic of a multi-line receiver for receiving a message code from a single wire active messaging section.

FIG. 10 is a flow chart illustrating the major steps of single wire active messaging logic for transmitting a message code to a multi wire receiver. FIG.

FIG. 11 is a flow chart illustrating the main steps of receiver logic of a single wire receiver for receiving a message code from a multi-line active messaging section. FIG.

12 is a flowchart illustrating the main steps of multi-line active messaging logic for sending a message code to a single line receiver.

FIG. 13 is a flow chart illustrating the main steps of multi-line receiver logic for message code polling by a disconnected caller. FIG.

FIG. 14 is a flowchart illustrating the major steps of disconnected caller logic for message code polling from a multi-line receiver. FIG.

FIG. 15 is a flowchart illustrating the main steps of receiver logic of a single wire receiver for receiving a message code from a multi-line active messaging section. FIG.

FIG. 16 is a flow chart illustrating the major steps of multi-line active messaging logic for sending a message code to a disconnected receiver. FIG.

First, referring to FIG. 1, which shows a block diagram of a communication scenario for data communication between two portions 10 and 12, communication medium 14 is a telephone network, which may be cellular, wired, or a combination of both. The telephone network may be a conventional network or an intelligent network or a combination thereof. These parts may be an operating center or operating point. Communication of portions 10 and 12 may be provided with a plurality of telephone lines (ie, multi-line systems) or telephone lines (ie, single line systems).

In the typical communication scenario shown in FIG. 2, data is communicated between one operating center 16 and a plurality of operating points 18, of which only three are shown for simplicity. Preferably, but not necessarily, the operating center 16 is a multi-line system and the operating points 18 are single line systems. The operating point, although not necessarily, is typically passive by a dispatcher or service provider, although it may be a fully automatic computer system, while the operating point receives or polls a message from, for example, a vending machine, a utility instrument, or an operations center. mobile service personnel required to poll and send messages to the operations center. Data messaging between two disconnected communication units is performed more efficiently through the intelligent network.

According to the present invention, as will be described in more detail below, data is communicated in more detail or between communication units such as (10 and 12) by means of a telephone line of a first portion that calls the telephone line, or a second portion that does not actually answer the call. Is communicated between the operations center 16 and the operating point 18. In general, data is communicated in consideration of the fact that a telephone line is called or a call is made from a telephone line. The data is also communicated taking into account the time elapsed from the first telephone "bell" until disconnection. The data is communicated in consideration of the state of the line because the binary code is set by setting the line to " on call " or " waiting on call. &Quot;

Although data communication is bidirectional, reference is now made to FIG. 3, which shows a caller 20 communicating with a receiver 22 via a telephone network 14.

Reference is now made to FIG. 4 which shows the main steps for the method of the present invention in accordance with the broader features of the present invention for communicating between the caller 20 and the receiver 22 via the telephone network 14. In step 24, caller 20 calls at least once from at least one caller's phone line. In step 26, the receiver 22 receives, but does not answer at least one call by the caller, so that a code is passed between the caller and the receiver. In step 28, a message is determined from the communicated message code, for example by searching a lookup table that correlates the message with the message code.

According to a first aspect of the method according to the invention, the code is carried by a receiver 22 which detects a receiver telephone line which is called by the caller 20 without the receiver telephone line responding to the caller. In addition, if the caller provides more than one call, the receiver detects the receiver lines in the order in which they were called. The code passed is provided by the receiver line taking into account the caller they were called.

To illustrate the method according to the first aspect of the invention, consider the case where the receiver 22 has 10 telephone lines, and the caller 20 calls the receiver telephone lines 2, 5, 9 in the above order. . The combination of numbers 1 to 10 and each of these numbers 1 to 10 relates to a message code known and provided to both caller 20 and receiver 22, followed by recipient telephone lines 2, 5, 9 By detecting that the call was made in this order, the receiver 22 receives a message from the caller 20 over the telephone network 14 without the callee responding to the calling line. The other message may be about a combination of 5, 2, and 9, and may be about a single number four.

Thus, a message can be transferred between two communication groups through a telephone network without answering even if there is a telephone call to be answered. In addition, this basic principle of the present invention can be used in other features of the present invention described below.

According to a second aspect of the invention, with respect to intelligent network operation, the code is conveyed by a recipient who detects from where the caller's telephone line and the receiver line are called. In addition, if the caller provides more than one call, the receiver also senses the order in which the calls are made.

For example, suppose a caller has 10 phone lines and the caller gives the call to the receiver in this order from lines 2, 3, 7, 10. The receiver senses that the receiver's line is called from the caller's lines 2, 3, 7, 10, and the call is made in this order. Again, the recipient does not answer the provided call. Thus, a call is made by sensing from the caller's line, and in this order the message is passed between caller 20 and receiver 22 via telephone network 14 without the receiver answering the provided call.

According to a third aspect of the invention, a step of preparing a receiver of at least one receiver telephone line in a "line-busy" or "line-free" state is added to the step shown in FIG. For example, suppose there are five receiver lines with a line busy state indicated by "0" and a line free state indicated by "1". Assume that the first, second, third, fourth, and fifth receive lines are 0, 1, 1, 0, and 1, respectively. The caller calls the receiver line starting from the first line to the fifth line and notifies the status. In this way, the caller polls the codes 0, 1, 1, 0, and 1 from the receiver. The message is then determined from the polled code by associating the code with a known message. Note that using "line busy", "line free" code is the same as passing it through binary code.

Sensing the status of the caller or receiver telephone line, or the receiver telephone line, is not the only way data can be transferred between two communication groups over the telephone network without responding to the telephone call. In other cases, the receiver may count the number of rings from the first ring until the caller's telephone call is disconnected. However, this approach is not robust because the number of rings sent by the caller does not always match the number of rings received by the receiver. Instead, according to the fourth aspect of the present invention, the code is conveyed by receiver sensing, where the receiver line is made together at the elapsed time between the clock trigger and the break.

In a similar manner, according to a fifth aspect of the invention, the code is also conveyed by receiver sensing, where the calling telephone line call is made together at the elapsed time between the clock trigger and the disconnect.

5-14 illustrate a number of specific embodiments of modules and methods in accordance with the present invention, as will be described below. Since the present invention is not limited by the specific embodiments shown in the drawings, it will be apparent to those skilled in the art that variations of these specific embodiments are possible within the scope of the present invention.

Referring again to FIG. 5, FIG. 5 shows a block diagram of the necessary modules of an active messaging group unit 50 in accordance with the preferred embodiment of the present invention.

The central processing unit 52 is a message code generator (ie, encoder). In most cases, the central processing unit 52 sends a message into a list of serially dialed telephone numbers by the communication control unit 54 using at least one modem or line interface 56 connected to the associated line. It acts as an interpreter. It should be noted that a single modem or line interface is completely sufficient for the operation of an active message family unit including message polling from passive message families. However, some modems or line interfaces connected to the relevant lines make the operation of the active message family unit more effective, especially when used as a receiver as well as a transmitter.

Intelligent network-data-decoder 58 (only for intelligent network operation) generally demodulates the caller identification code and the message arrival time data modulated by the network operator at the network switch between the first and second rings. , But not necessarily, a communication control device 54 that filters out lines that call unauthorized phone numbers, such as participating members of a connection time precoding system. Note that for digital networks, intelligent network data is decoded according to the data protocol used by the digital network. The caller identification code / message code decoder 60 constitutes a caller identification code (for CN operation) and an incoming message code, which is composed of a message source and a message element and which provides the incoming message in full sense. Processor: 62). The message code for an incoming or outgoing message preferably consists of the least important message element. By using this feature, partial messages can be decoded even when the message procedure is not completely completed.

The passive messaging party polling controller 64 works in conjunction with the communication controller 54 to poll messages specifically prepared by calling the passive messaging party line by line.

Modules 52-64 define the net active messaging party architecture. Several extra lines, collectively included with the queuing module and indicated at 70, are used to queue the caller to avoid mixing of messaging processing. Each extra line is coupled to a “busy” / “free” tone generator that enables communication controller 54 to change the state of the line from “free” to “busy” or vice versa.

The queuing module 70 is not essential if the active messaging party unit 50 does not operate in a given environment as a polling party in an intelligent network sharing the polling line with a standard data line. In addition, the queuing module is not essential for intelligent or normal network operation when an active messaging party receives a message from a single communication party (typically, an operations center). If the messaging party unit 50 acts as a standard multi-line receiver, then the queuing module 70 is always needed when operating with a conventional network. Only required for notification and polling when working with intelligent queuing module 70. The use and operation of the extra line comprising the queuing module 70 will be described in detail with reference to the particular application. The main functions of each line will be briefly described below.

The queuing module 70 includes a message registration line 72, a notification registration line 74, a response line 76, and a polling list line 78. The first line called by the caller using normal network operation is the message registration line 72. If the line is "free" then the caller commences the desired messaging process, whereas if the line is "busy" then the caller does not approve to continue the messaging process and registers the message until the line is "free". Line 72 must be called again.

Polling registration line 78 is for identifying the caller and signaling the receiver to prepare a message code for a particular caller. In addition, switching both message registration line 72 and polling registration line 78 to “busy” blocks access to other concurrent callers.

Response line 76 is used to check if the caller is waiting for a message. If it is waiting for a message, then the response line 76 will be set to "busy" after the question mark of the caller of the registration line.

Notification registration line 74 may be used to verify that the correct message code has been received and to terminate the messaging process by the response request from the receiver.

6 shows an exemplary block diagram of the required module of a passive messaging party unit 80 in accordance with a preferred embodiment of the present invention.

The combined central processing unit and nonvolatile memory 82 decode the received message code and encode a message for polling by an active messaging party. Message decoding is handled using a plurality of data lines 84 (N lines shown in the figures) or line interfaces 86 alternately connected to associated lines, each connected to a modem. Each data line 84 is coupled to a "busy" / "free" tone generator that enables central processing unit 82 to change the state of the line from "free" to "busy" or vice versa. A "busy" / "free" tone generator is only needed if the receiver is polled. Data line 84 is called in series by an active messaging party. It is preferred that the first line called is the most important element code and the last line called is the least significant element of the code. In normal network operation, the preamble of the code is the caller's identification code, whereas in intelligent network operation, calls made by active messaging parties only encode message codes.

The queuing module 90 includes a message registration line 92, a notification registration line 94, a response line 96, and a polling registration line 98. The queuing module 90 is used to queue callers to avoid mixing of messaging processes. Each of the lines 92, 94, 96, and 98 is coupled to a "busy" / "free" tone generator that enables the central processing unit 82, thereby changing the state of each of the lines from "free" to "busy". Or vice versa. Lines 92, 94, 96, and 98 are also coupled to modem or line interfaces 102, 104, 106, and 108, respectively. Since the basic operation of the lines 92, 94, 96, and 98 is the same as the basic operation of the lines 72, 74, 76, and 78, description thereof will be omitted. However, the message code registration line is not used in intelligent network operation and the notification registration and response registration lines are used only when the receiver is a passive messaging party. The "busy" / "free" tone generator and polling registration line coupled to the N data line 84 are used only for polling operations.

The intelligent network data decoder 110 is capable of extracting the caller identification code and the message arrival time data through demodulation or protocol decoding for the digital network, which enables on-line verification of the caller with each called line. As such, several incoming message codes can be received and decoded simultaneously.

Operations centers that typically operate as receivers of calls made by passive messaging parties, or active messaging parties, are typically based on multi-line configurations where the number of lines per passive messaging party is based on the principle "THE MORE THE BETTER". More lines means more flexibility in data transmission and reception and / or shorter transmission / reception time per message. The active messaging party unit acting as a receiver may be based on the same architecture as the active messaging party as shown in FIG. 6.

Caller identification is essential as the first stage of message code decryption. An active message party sent to the receiver must acknowledge itself to the receiver, and an active message party polling a message from another party can also identify itself so that another party can prepare a particular message for the current caller. .

If the communication is with an intelligent network, the caller identification code and the message arrival time, usually the interval between the first and second call ringings, are normally modulated on the carrier frequency of the communication signal transmitted through the telephone network, It can be extracted directly by a connected modem or line interface. For example, a digital network, such as ISDN, sends a caller identification code as part of a "hand shake" communication protocol between the caller and the receiver. The modem or line interface may be one of the appropriate modems or electrical boards designed to extract the caller identification code and message arrival time through demodulation.

If the communication is over a conventional network based on one or more potential callers, the caller identification code is coded in a preamble message code. The encoding of the caller identification code is based on successive calls to receiver incoming lines. The caller identification code may be encoded by any predefined basis.

The caller identification code is given by the order in which incoming lines are called. For example, assume that the receiver has 10 incoming lines, which are receiver lines labeled 1-10. It is also assumed that a caller with a caller identification code of 1707 calls the receiver. In order for the caller to be identified, the caller disconnects after calling receiver line-1, disconnects after calling next receiver line-7, disconnects after calling next receiver line-10, and finally connects after calling receiver line-7. Block it.

In this example, a receiver having only 10 lines can distinguish up to nine callers using only one call as the caller identification code, and up to 99 each using 2, 3, and 4 calls as caller identification codes. , 999, and 9999 callers can be distinguished.

However, a receiver with 100 lines can distinguish up to 99, 9999, and 999999, and 99999999 callers, respectively, using 1, 2, 3, and 4 calls as caller identification codes.

In order to avoid interference between several callers attempting to transmit or receive data to or from the same source within the overlapping period in normal network operation, the caller identification code encoding procedure is required to register a message code in the case of message transmission. It must proceed by calling the line, and when polling a message it must proceed by calling the polling registration line. In the following, when these two lines do not need to be clearly distinguished from each other, they are collectively called a registration line.

If the registration line is "free", the caller has the right to proceed with the caller identification code encoding procedure and the receiver registration line is changed to "busy" so that another caller does not interfere with the messaging procedure at the same time. The caller may terminate the caller identification code encoding procedure by a messaging (or polling) procedure. On the other hand, if the registration line is "busy", the caller is not authorized to perform the messaging (or polling) procedure and the caller must continue the call until the registration line is "free". Accordingly, the registration line performs "queuing" for the synchronous callers, whether it is a message code registration line or a polling registration line.

Clearly, the use of the caller identification code is necessary to make the functionality of the messaging (or polling) procedure in practical scenarios where several callers exist. Therefore, the decoding and encoding procedure of the caller identification code is described in detail.

First, reference is made to FIG. 7, which shows a flow chart for caller identification decoding by a receiver using intelligent or conventional network operations. If intelligent network operations are used in step 200, the intelligent network data received in step 202 is decoded through demodulation of the incoming call. In digital networks, the received intelligent network data is decoded according to the data protocol used by the digital network. In step 204, a caller identification code and message incoming time are generated from the decoded data. The identification decoding procedure for the intelligent network is now completed, and message decoding or encoding can be initiated, if necessary, in step 206.

If normal network operations are used in step 200, then a registration line (message-registration line or polling-registration line) is called in step 208. If one of the registration lines is receiving a call, in step 212 the "busy" / "free" tone generator switches the registration line to "busy". If a multi-line receiver uses the same group of data lines for message reception and polling procedures, both message registration and polling registration lines are switched to "busy" at the beginning of the messaging or polling procedure until the specific procedure is completed. . However, if the receiver uses one of the two separate groups of data lines for the messaging procedure and the other for the polling procedure, the queues for the two procedures are separated without overlapping. Only the registration lines related to the particular procedure in question need to be called and set to "busy".

In step 214, the "time-out" procedure is turned on. Step 216 indicates that the caller identification code including the LI elements will be decoded element by element. In step 218, the code element index i is set to zero. Steps 220 through 230 define a loop through which identification code elements are received. In step 220, the code element index i is incremented by one, and in step 222 the "time-out" is checked. If "time-out" is reached, then at step 224 the identification code decoding procedure is aborted and the associated registration lines (message code and / or polling) are set to "free". If the "time-out" has not been reached, the ni-th receiver line rings in step 226. If a time measurement is used, it will ring for the ringing period TRi until a disconnection is detected. In step 228 the i th element of the caller identification code is decoded from the database. If time measurement is used, the i th element of the caller identification code is given as a combination of ni and TR i. If no time measurement is used, the i th element of the caller identification code is given as ni. In step 230, it is checked whether the last element (i = LI) of the caller identification code has been reached. If the last element has not been reached, control passes to step 220 and the next receiver line is called. On the other hand, if the last element has been reached, a complete caller identification code may be prepared and decoded at step 232. The identification code decoding procedure for the conventional network is now complete and the message decoding or encoding can be initiated, if necessary, in step 206.

Referring now to FIG. 8, which shows a flow chart for caller identification code encoding by a caller using an intelligent network operation or a normal network operation. If, at step 300, an intelligent network operation is used, caller identification code encoding is essential and no further action is required. In this case, the caller identification code is modulated with the carrier frequency of the communication signal transmitted through the telephone network. In a digital network, the transmitted intelligent network data is encoded according to the data protocol used by the digital network. Control then exits from the caller identification code encoding process, and transfers to another process, which may be an encoding or decoding process of the message code, in step 302.

In step 300, if normal network operations are used, control is transferred from step 304 to polling registration steps 306 to 310, or to message code registration steps 312 to 316. Although this is not an integral part of the identification code encoding, if the caller calls the receiver for any reason, as far as receiver logic is concerned, proper registration is preceded by the receiver after receiving the caller's identification code prior to receiving the caller identification code. It is certain to know how to continue. After the registration is successful, the caller disconnects after waiting for T seconds, or waiting for the K-ring. After the caller successfully registers with the receiver at step 318, the "time-out" procedure is turned on at step 320.

In step 322, the caller prepares an identification code to be encoded. This is done by defining a series of receiver lines (LI) to be called, and assigning a ringing period TR according to the coding conversion table for each line to be called, if a time measurement is used. Note that the measurement of the ringing period is optional and, if used, adds additional degrees of freedom in making the message code. Caller identification codes are preferably made with, but not necessarily, the most important first code element and the least important last code element. This method ensures that if the end of the caller identification code has not been communicated for some reason, the receiver can know that any caller in the group of callers with at least the same code beginning has called.

In step 324, code element index i is set to zero. Steps 326 through 340 define a loop in which caller identification code elements are encoded. In step 326, the code element index i is incremented by one, and in step 328 "time-out" is checked. If the "time-out" has been reached, in step 330 the caller identification code encoding procedure is aborted and the encoding procedure is interrupted and the encoding procedure starts from the beginning (step 304). If the "time-out" has not been reached, the nith receiver line is called in step 332. If the nith receiver line is "busy", at step 336 the caller disconnects and waits for TB seconds before calling the nith receiver line again. If the ni-th receiver line is "free" in step 338, the caller waits for a K-ring or TRi seconds before disconnecting. Note that if no time measurement is used, when calling each receiver line, the caller will wait for the same time period (T seconds) for each receiver line to be called and received. In step 340, it is checked whether the last element (i = LI) of the caller identification code has been encoded. If the last element has not been encoded, control passes to step 326 and the next receiver line is called according to the caller identification code. On the other hand, if the last element was encoded, then the complete caller identification code is encoded in step 342. The caller identification code encoding procedure in the conventional network is now completed and the message encoding or decoding can be initiated, if necessary, in step 342.

Once the caller identification code has been received and confirmed, a message code sent by the caller may be received. It is important that message codes have well-defined structures. In the following, basic concepts relating to the structure of message codes are described.

Message codes are preferably made with, but not necessarily, the most important first code element and the least important last code element. This method ensures that at least an important part of the message is received if the end of the message is lost. According to this method, if the data is to be added to the associated data base message, the associated data will have to be appended to the end of the message code.

The message code is associated with a message through a database that associates specific telephone lines (ie, specific line indexes) with numbers, words, messages, or a combination thereof. The message code may have any number of elements, defined as the first (most important) element in the database.

Preferably, a "code-structure" comprising a "group" and a "subgroup" each has a code of consecutive sub-groups, starting with a first element, so as to have a "decodeable" and usable meaning. It must be constructed.

Receiving and sending a message code by connection time free data messaging is described below with examples based on commercial applications. According to the present invention, in all examples, calls are generated but there is no response. In other words, the use of the word " call " refers to " connection-time free call ". Also, in the following examples, the slash "/" is used to indicate an option. For example, A / B / C represents A or B or C.

The first example relates to receiving / sending message codes from / to a fully / semi-automatic point-of-service (eg, bending machine) in connection time free. Four different cases will be considered. The following assumptions are made:

(a) The automation point of the service smart controller may detect and identify an NE event that may indicate a technical failure of one of its sub-systems or indicate that an item placed on site should be refilled.

(b) The operation center controlling the service NA (number) point (or point of sale) is a NO data line, preferably for intelligent network operation, for data transmission and reception except for message registration lines, approval registration lines, response lines, and polling registration lines. Use

(c) three typical messages

(Ⅰ) power failure,

(Ii) vending machine-the motor of the Ith production line (of NC, for example 16) is stopped,

(Iii) the automation point of the service must be refilled with the product combination and the quantity j (in NQ, for example 128),

It is thought to be.

Case-1: The Operations Center reports NE events (NE <26, some may have relevant data) using the NO = 25 data line.

In this case (i.e. for intelligent network operation), the message will require (i) one call on one of the 25 data lines. However, the message will require (ii) two calls, one of which designates a failure and the other designating a vending machine (motor number). The message will require (iii) three calls, one of which specifies a refill request, and two of which specify refill combining and amount j using 25-based coding, where two of the element code The first has a partial meaning.

Thus, although the message codes for messages (iii) and (ii) are based on a code having one or more elements (ie, one or more calls), these message codes may be blocked after message delivery is blocked after the first element has been received. It will be clearly understood that has a well defined meaning.

Case-2: The Operations Center reports a NE (NE <26) major event using the NO = 200 line, some of which have related data in k combinations, but the total number of possible additions NP <200 Satisfied.

In this case, all three messages (iii), (ii) and (iii) require a single call received at the sales automation point to the operations center.

Case-3: An operations center using a 25/200 line needs to switch the sales parameter structure i to structure j (as with the intelligent network active message delivery group).

In this case, when NO = 25, one call is required to switch the parametric structure if the structure selection below 25 is valid. However, if more than 25 structure choices are possible, two calls will be required. When NO = 200, even if the total number of structure selections is 200, one call is required for accurate switching of parameter selections.

Case-4: The operational center of the above example is a manual message delivery group. The retrieval of parameter selections required for accurate switching of point of sale automation through polling may require 4, 5 or 6 calls from the active message delivery group to the passive message delivery group, respectively, for 7, 15 or 31 configuration choices. will be.

A second example relates to a connection time for sending and receiving message codes to and from a mobile monitor service unit, such as a mobile service fleet unit. Three different cases will be considered. In this example, the message received by the mobile monitor service unit includes two types of messages. One is to direct the service unit to the designated location (a database of NA locations, ie service points), and the other to perform the designated task (list of NT tasks).

Each task has an NR reporting a milestone, which can be accomplished by GPS location measurement (location determined within the accuracy of AC) to determine the location of the service unit within a predetermined marking area AR. At the specified communication frequency, reporting the service unit location with its status is an appropriate message code.

Case-1: The Operations Center controls NA = 200 / 20,000 service points, which may require one of NT = 10 different types of tasks. The Operations Center must use the NO = 25/200 data line and send to the mobile service unit work orders that specify commands, tasks, and points of service locations that are performed within the daily route based on 20 different service locations. .

If NO = 25 and NA = 200 / 20,000, the operations center would have to place 3/4 calls each to send a message code. The first two-thirds call will be used together to specify the service location and task using 25-based code, and the final call will define the task sequence along the daily route. If NO = 200 instead of NO = 25, only 2/3 calls each would be required to send the message code, where 1/2 calls would be used to specify the service location and task respectively, and the remaining calls would be the daily route. We will define the order of tasks along the way.

Case-2: The mobile service unit (NU = 150), which communicates with the operation center of Case-1, has an accuracy of AC = 1.5 km or 0.15 km within an area of 150 * 150 mW (for intelligent network operation). You need to report task i in milestone j with and without location details.

If NO = 25 and AC = null / 1.5 km / 0.15 km (null means no location is needed), then the mobile service unit will need 1/4/6 calls for each message code. If NO = 25 and NO = 200 line operations centers are used, the mobile service units will only need 1/3/4 calls each.

The first or first message code element is NT or NR-only in both cases, and the first milestone is reported by calling one of the NT (20 in each case) designation lines, followed by the first milestone. The remaining NR-1 milestones use the other (NR-1) line, which in this case is 4. Subsequent calls are used to report the location of the mobile service unit. Each call represents a geographic area. The geographic area may be displayed using a series of squares called primary squares. These squares can be divided into smaller squares called secondary squares, and each of the secondary squares can be divided into smaller squares.

The first call indicates that the mobile service unit is located somewhere within the primary square that corresponds to the called line. If the resolution of the primary square is sufficient, no further calls are needed. If the accuracy of the secondary square is required, a second call is located indicating that the mobile service unit is located somewhere in the secondary square corresponding to the called line. This process is repeated according to the required precision.

Case-3: This is the same as Case-2 except that the system uses normal network operation. In this case, the message must be directed by the call or calls providing the caller identification code. Therefore, 1/2 arcs must be added to the number of arcs provided in the NO = 25/200 line.

A third example relates to sending and receiving access time free message code from / to a user wanting to call and / or pay for a service, or from a product supplied by a server. The latter has a connection time free transceiver and associated message decoding and encoding software. This example is for an operator who wants to "check in" / "out" a "on-" or "off-street" parking, to be serviced by car washes, or to pay for gas at a gas station, or automatically. Applicable to callers who wish to purchase quality products or services from vending machines or delivery services. Of course, it can be applied in other ways as appropriate. All of the following examples will be referred to as electronic transactions, and transaction costs will be part of the message delivery process. That is, this example relates to a cost related message. Of course, the cost related messages included in the present invention are not limited to these specific examples. Two different cases will be considered. The following are assumed.

(a) The vending point of the vending machine smart controller or service indicates that the NE events that may specify the identified purchaser's request for a sufficiently limited product / service, or the selection of the product or service, sends a correct selection signal to the machine ( For example, by pressing a displayed key) while detecting and identifying an event that can only display the request of the identified purchaser.

(b) The operations center controlling the NA (number) point (or point of sale) of the service sends and receives data using the NO data line, which is preferably intelligent network operation, except for the approval line.

(c) Attracted users of the system may call the service / product using one of the following alternative modes.

If the message is a single element code and the time is not related to decoding. The user of the system uses his / her telephone (cellular or wired) rather than using a dedicated terminal to service / supply from the vendor call number ######. Purchase the product (name) or disconnect.

The message is a multi-element code (or time dependent code), and a dedicated terminal or cellular device connected to the wire line should preferably be used to instruct the user using a menu, for example a method of selecting an order.

(d) Three typical messages are considered:

(Iii) A request for purchase of a single item (from an NP service or product previously defined by the supplier), meaning that processing costs are well defined by the message code.

(Ii) A purchase request for an unknown amount of a well-defined product (e.g., "fill my tank", or "I am starting a parking session for unknown period of time"), meaning that processing costs are defined upon completion of the purchase.

(Iii) Purchase request (from the detailed menu defined in advance) of a trailing "shipment list" meaning that processing costs may be defined before delivery but must be accumulated by analyzing the list contents.

Example-1

The operating center uses the NO >> NP data line to control the processing associated with NP other products or services. In this case, the message requires one call to one of the data lines. However, message (ii) requires either a call that initiates a purchase or service procedure and another call that terminates it. Optionally, in this case, instead of the end-of-sale call, the user can sometimes manually stop the smart controller on the "on site" to detect a stop signal (the "process end" message is parked). ), While the "Stop" key is more relevant to electronic processing, such as gas refueling). The message i) requires any number of calls starting from one when the NP is small (= 2-3). As the series of calls become very long, the efficiency of the procedure is greatly reduced.

In all three of these message types, the final element code of the message precedes the message (i) and, as agreed upon upon completion of the processing of the message (ii), in a dual sense-a) providing the product / service to the caller, b) processing Receive a price for-has. These prices can be billed through billing files defined by each process, providing a collection of public network operators who provide communication services to billing entries as agreed between identified callers or parties (eg credit card companies). can do.

Example-2

The receiving side utilizes a NO = 1 data line to control NP> 1. In this case, the message requires more than one call to the data line unless the caller is instructed by another means, ie, pressing a key on the vending machine, i.d. of the selected product or service after the message has been placed. As a result, the maximum importance portion of the message defines the request for electronic processing to be paid by the caller, and the minimum importance portion defined by pressing the key identifies the required product or service and their value. Message (ii) utilizing the same mechanism requires either a call that starts a purchase or service procedure and another call that ends it. Optionally, in this case, instead of an end-of-sale call, the user may sometimes manually stop the smart controller on the "on site" from detecting a stop signal (the "process end" message is parked ( while the "stop" key is more related to electronic processing, such as gas refueling). Messages cannot be communicated efficiently in this case.

Having described the basic concept of the structure of a message code, the following describes the messaging procedure for connection time not receiving / transmitting a message.

Three basic messaging procedures: (i) a single line caller calls a multiline receiver, (ii) a multiline caller calls a single line receiver, and (iii) a single line caller polls a multiline receiver. -Is explained. Specific examples in each procedure are given in both caller logic and receiver logic along with flow charts illustrating the general messaging procedure for each of these examples.

It should be noted that the multiple line to single line, single line to multiple line, and single line to single line messaging procedures are specific examples of the multi line to multi line messaging procedure. Since service points are as inexpensive as possible and operations centers must be efficient, service points are generally single line, and operations centers are generally multi-line, so the three basic messaging procedures to be described are important.

Consider first the single-line active messaging side that sends the message to the multi-line receiver.

In artificial intelligence network operation, each call is identified independently, so that messaging stops can support many callers (active messaging side) that initiate data retirement during transmission periods overlap. The message code sent by the active messaging side is a code constructed as a series of receiver incoming lines, preferably determined from the "most" or "least" critical element of the code, where each " Element "corresponds to the index i of the called receiver line.

The message code encoding and decoding procedure is based on the following assumptions:

(a1) The communication side has a predefined database of MM messages and associated message codes in their arrangement.

(a2) The receiving side utilizes N lines for receiving the message code, each line characterized by index i.

(a3) The relationship between MM and N, together with optimal coding considerations, requires that the message code be based on the MI element, where the first element is preferably the "maximum" critical element and the MI element is the "minimal" critical element . For example, if MM = 9 or 99 and N = 10, then MI = 1 or 2. Similarly, if MM = 99 or 9999 and N = 100, then MI = 1 or 2.

(a4) Each caller has a predefined time to send a MI element message from when the caller reaches the called line representing the "maximum" critical element of the messaging code and finds the called line in the "free" state. Has (TIME-OUT).

(a5) The messaging procedure may be terminated by a request for confirmation from the receiver confirming that a correction message code has been received. This verification is accomplished in one of two ways depending on the nature of the receiver.

If the receiver is a passive messaging side, the messaging procedure should proceed by caller registration performed by the caller calling the confirmation registration line of the passive messaging side informing the passive message side of interest that the caller is receiving confirmation of the message. Should be. If the confirmation registration line is "busy", the caller continues the call until this line is "free". After the registration is confirmed, the no acknowledgment or partial acknowledgment message code waits for the caller through the "busy / free" status of the response in on the passive messaging side.

However, if the receiver is an active messaging side, the associated message code may be sent to the caller on the success of the message procedure.

(a6) The AI structure of the message database, in addition to the fact that the encoding procedure is based on the transmission of critical elements from "maximum" to "minimum", may receive a partial message when the procedure is not disconnected for any reason before completion. An example illustrating the importance of partial messages that are difficult to apply is described below: Partial messages may be extracted from code in which each element is represented as a subgroup of the previous element.

In normal network operation, the message sent by the active message side must proceed with the identification code serial encoding procedure described above. Thus, only one active messaging side can communicate with a given passive messaging side at a time.

During the entire procedure, termination of the procedure due to an unacknowledged or partial acknowledgment message code, or "time-out," begins from the caller identification until the final receipt of the confirmation via messaging, and the message code registration line is the passive messaging side. This must be occupied and in a "busy" state, indicating that no new messages from other callers can be received. Upon completion of the procedure due to the "time-out" termination or due to the completion of the confirmation procedure, the message registration line switches to the "free" state and the receiver is ready to receive a new message code. Even when the receiver is on the active message side, the acknowledgment line should be queried by the caller so that the previously established identification code is not lost. This is in stark contrast to the case of AI operation, where the caller identification code is modulated on the carrier frequency of the communication signal.

Due to the structure of conventional network operations that cannot tolerate multiple callers attempting to send and receive data to / from the same receiver within an overlapping period, it is often more effective to subclass NO receivers into n subgroups, each subgroup The groups operate as independent receivers, and as a result, n message codes can be sent and received in parallel. For example, the efficiency of a 100-line conventional network receiver after subdividing the line into 10 independent groups is five to six times higher compared to a single 100-line system. That is, 5 times more calls can be received per unit time.

The process for a single-line active messaging caller for sending a message to a multi-line receiver is summarized in FIGS. 9 and 10. The following notation is used in these two figures.

MM indicates the total number of message codes used,

MI indicates the number of elements in the message code,

N denotes the total number of lines the receiver is indexed to,

i, j are the index of the message code element,

ni (nj) is the index of the i (j) receiver index line,

OM is the number of different element code values = N * TV, where

The TV displays the number of possible time values (rounded up) measured from the RK paper clock trigger in the event of a disconnection.

The effect of time measurement on the comparison of time-dependent and time-independent messaging and the number of message codes obtainable is described. If a single-line active messaging caller sends a message to a 10-line multi-line communication caller and receives a message from a multi-line communication caller, let TV = 4. Each call then represents one of the 40 message code element values instead of 10 if the coding process does not use the time-dependent message code element value (i.e., the coding process is a period from the first " ring " to the disconnection. Ignored). Thus, based on 2 or 3 code elements, the time dependent message code is equivalent to 1600 or 64000 different message code accumulations compared to only 100 or 1000 different message codes if the coding process does not use time-dependent message code element values. generate arsenal, respectively.

Attention is first drawn to FIG. 9 which shows the main steps of the receiver logic of a multi-line receiver for receiving a message code from a single line active messaging caller. In step 400, the message code is received by a multi-line receiver from a single-line messaging caller. MM is the total number of message codes used, and OM is the total number of different element code values. In step 402, if MM &lt; OM (i.e., a single code element defines a message), control is passed to step 448. Step 450 distinguishes between the two cases. If the total number of message codes used (MM) is less than the receiver index line (N), in addition to the line index (ni) of the called line, the measurement of the ring period (TRi) in order to limit the message code is carried out on the line (ni). (Steps 456 and 458). On the other hand, if MM> N, the message code is defined by satisfying the line index ni of the called line (step 452). In step 454, the caller identification code, message code and message arrival time are defined. Control is passed to step 430 described above.

At 402, if MN &gt; OM (multiple calls are needed to communicate the message call), then the message code received at step 404 is set element-to-element from the first element to the MIth element. Probably, but not necessarily, the first element is the top element of the message code and the MIth element is the bottom element.

In step 406, the " time-out " process is initiated, and in step 410, the message code element index J is initially set to zero. The incoming message code is set within the loop defined in steps 410 to 418, where the j th element of the message code is given by nj and TRj. If no time measurement is used, the j th element is given only by nj. Assuming that "time-out" is not registered during the process, the loop ends at step 418 immediately after all message code elements have been received. The receiver is assumed to know how many code elements are expected. This can be accomplished in a number of ways. For example, it may be agreed in advance that the first received element indicates the total number of elements the receiver can expect to receive. According to this approach, the total number of elements that the receiver can expect to receive is given by MI (n1), where n1 is the index of the first called receiver line.

In step 420, the message code is decoded by comparing the received message code element and the message code element with a conversion table associated with the message or portions thereof, and the caller is associated with the message by notifying the caller recognition code and the message arrival time. Are identified together.

In step 412, if the "time-out" completes the process before all code elements are received, there are two possibilities regarding the number of code elements received. These two possibilities are checked in step 422. If at least one code element is received (ie j> 1), in step 424 and 426 the partial message is determined from the received message code element, and the caller is responsible for the partial message by noting the caller identification code and the message arrival time. And a partial acknowledgment message code is prepared. On the other hand, if no message code element has been received (ie j <1), then at step 428 a non-response message code is prepared.

If the multi-line receiver is an active messaging caller, control is passed to step 431 in step 430, and the multi-line receiver sends the appropriate message code (i.e., response, non-response or partial response) to the single-line caller. . On the other hand, if the multi-line receiver is not an active message caller, the single-line caller (which is the active messaging caller) may call the multi-recipient's response registration and reply line as described in steps 432-440. The status of the message received by the circuit receiver must be obtained. In step 442, it is determined whether the single-line active messaging caller is interested in polling a message from the multi-line receiver. It is understood that polling is required if the polling registration line is called within TP seconds (446). On the other hand, if the polling registration line is not called within TP seconds, polling is not necessary and the message registration line switches to "free" only in normal network operation and the receiver prepares for the next message.

10 illustrates the basic steps of single-line active messaging caller logic for sending a message code to a multi-line receiver. In step 500, the identification code (IDC) of the active messaging caller is encoded (see FIG. 8) and the code messaging process is triggered. If MI <OM in step 502, the message may be communicated by calling a single receiver line (ie, a single code element defines the message). In step 554, if the line of the multi-line receiver defines a message, for example the ni-th line is called. If the nith line is " busy, " control passes to step 558 where the caller disconnects and waits for TB seconds before calling the nith line of the multi-line receiver again. If the nith line is "idle", at step 560 the caller waits for k rings or TRj seconds before disconnection. Again, if no time measurement is used, the single-line active messaging caller waits for the same period of time, T seconds, before disconnection, regardless of which receiver line is called. At step 562, the caller proceeds to a response process beginning at step 530.

In step 502, if MI> OM, the message may only be communicated by calling multiple receiver lines (ie, more than one code element defines the message). In step 504, it is detailed to define the code element of the required message code in order for the receiver line to be called. Preferably, but not necessarily, the first element is the highest element of the message code and the second element is the lowest element of the message code.

In step 506, the " time-out " process is initiated and in step 508 the message code element index j is set to zero. In step 510, the value of index j is increased by one. In step 512, the receiver line corresponding to the j th code element of the message code is dialed. In step 514, if the dialed line is in a "call state", control passes to step 516, and the active messaging caller disconnects for TB seconds before redialing. On the other hand, if the dialed line is not in the "call state", control passes to step 518, where the active messaging caller waits for TRj seconds before disconnection or waits for kj ring. If no time measurement is used, the active messaging caller waits for each line called before disconnection for the same period of time, for example T seconds.

In step 520, it is checked whether all receiver lines defining the message code are successfully dialed, i.e. j = MI. If so, the full message code is sent to the receiver in step 529, and the process continues from step 530 with a message response process. If the multi-line receiver is an active messaging party, then at step 530, control is transferred to step 531, and the single-line caller is appropriate from the multi-line receiver. Wait for a message code acknowledgment (ie, response, no response, or some response). In contrast, if the multi-line receiver is not an active messaging caller, the single-line active messaging caller caller, as described in steps 532 to 550, may reply to the registration and reply line of the multi-line receiver. Calls to obtain the response to the status of the message received from the multi-line receiver.

If j? MI in step 520 and " TIME-OUT " has not been reached (step 522), then the next line is called (steps 510 to 520 are repeated). If the "time-out" has not been reached in step 522, then if at least one line is called (step 524), some response message code is prepared (step 526). If, on the other hand, no line is called, the procedure is aborted (step 528) and restarted if desired.

From now on, only with respect to intelligent network operations, consider a multi-line active messaging caller sending a message to a single or multi-line receiver.

Unlike the previous case in which encoding uses a receiver multi-line structure, in this case, the encoding is based on the fact that each active messaging caller has several call lines on which a message code can be generated. Since this case is limited to intelligent network operations, the caller identification code is extracted directly from the call signal. However, since each caller uses multiple circuits, the decoding link between the call and the message code is a multi-step procedure, summarized as follows:

(a) extracting an identification code and a message arrival time from the call signal;

(b) identify which call line is the attached caller;

(c) identifying the value of a particular identification code among the identified caller lines;

(d) if there is an element previously received, assigning index i to the message code element based on the message arrival time, and the previously received element (i-1);

(e) Decode the message if all message code elements are available, or if the "time-out" interrupts this procedure before completion of the procedure, decode the message code.

In this case, if necessary, the response is made in one of the following ways:

If the receiver is an active messaging caller, the receiver will send a response, no answer, or some response message code to the caller.

If the receiver is a passive messaging caller with answer registration and reply lines, the caller will query the receiver for a reply message code.

If the receiver is a passive messaging caller with no answer registration and reply lines, and the caller is the message source calling the receiver at the time, the receiver will "busy" a single line for T seconds if the reply or some reply is an appropriate reply. ), Or leave "free" if no answer is a proper reply, and the caller will contact the receiver immediately upon completion of the messaging procedure for this signal.

A flow chart for a multi-line active messaging communicator sending a message to a single-line receiver is given in FIGS. 11 and 12, which will now be described. The following notation is used for these two figures:

TR indicates a ringing period,

i, j represent the index of the message code element,

TRj indicates the ring period for the jth message code element,

IDC is generally defined as a code that specifies the identification of the message source in sufficient detail, and referring to FIG. 11, this means the identifier of the caller and the line called by that caller.

First, note FIG. 11, which shows the basic steps for receiver logic of a single-line receiver for receiving a message code from a multi-line active messaging communicator. In step 600, the call is received from a multi-line active messaging communicator. The received message code is known based on the KI code element decoded from the caller identification code (IDC) value. In step 602, a call is received, the caller identifier and the call line of the caller are identified, and the ring period TR is measured. Again, it is emphasized that the measurement of the ring period is optional and, when used, adds additional degrees of freedom in the generation of the message code.

If a first caller of a given caller is received, the decoding session will not be "on" and the current call is made by step 604 where control is transferred to step 606 and the "time-out" procedure is initialized for the current caller. The decoding session for the child is declared "on". In step 608, the first code element of the message code is taken to be the number associated with the caller identifier and the line called by the caller, and index i is set to one. At step 610, a check is made to see if the received message code is based on one code element (KI = 1). If the received code is based on one code element, then at step 612 the message code prepares for precise decoding to generate the identified message and message arrival time.

If the receiver is an active messaging communicator, then control transfers to step 616 in step 614, where the receiver will send the appropriate response message code to the caller, which may be one of response, non-response, or some response message code. Control then passes to step 618 where the receiver waits for the next call. However, if the receiver is not an active messaging communicator, then control transfers to step 620 in step 614, where the receiver waits for a response message code query by the caller. Of course, the receiver prepares an appropriate response message code for the caller on the registration line. Obviously, then, if the receiver is not an active messaging communicator and the caller must receive a response message code, the receiver cannot be a single line receiver. Next to step 620, control transfers to step 618, where a "time-out" is checked for the current decoding session. If the "time-out" is not reached, control returns to step 600.

If "time-out" is reached in step 622, then in step 624 a check is made to see if the message code element has been reached for the current caller. If no message code element has been reached for the current caller, then at step 626 the message receiving procedure is stopped for the caller and control is transferred to step 614 for relaying the unresponsive message code to the caller. If some, but not all, message codes have been received from the current caller, the caller's message code may be partially decoded after control transfers to step 614 where some response message code is relayed to this caller. 628). This control then transfers to step 618 and then to step 622.

If the decoding session is "on" for the current caller in step 604, control passes to step 630, the index i of the previously decoded element of the current caller is examined, and then in step 632 j is 1+. is defined as i. In step 634, it is associated with the caller identifier and the circuit called by the caller via the j th code element database-to-base conversion table.

In step 636, it is checked whether the code element has been reached. If all code elements have been reached, then in step 612, after the response of steps 614 to 620 is performed as described above, the received message code is ready for decoding.

Attention is now directed to FIG. 12 which illustrates the basic steps of multi-line active messaging communicator logic for sending a message code to a single-line receiver. In step 700, the multi-line receiver generates a message code transmission using an intelligent network operation. In step 702, a message code using a KI element is encoded. Each code element is represented by one of the caller's line numbers appended by the call ring period TR. Preferably, it is not necessary to create a message element with the first code element that is the highest message element and the last (KIth) code element that is the lowest message element.

In step 704, the "time-out" procedure is initiated. In step 706, index i is set to zero. In step 710, a check is made to see if the "time-out" has been reached. If the "time-out" has not been reached, at step 712, the multi-line active messaging communicator calls the receiver from the line assigned to the i th code element. If it is in the "call state", in step 722 the caller disconnects and waits for TB seconds before returning to step 712. Otherwise, if the receiver line is not in a "call state", the caller waits for TRi seconds before disconnecting (step 716). In step 718, the code element index is checked. If the KI th element has been sent, then the complete message code has been sent (step 720), and the process continues with the response / polling procedure (steps 730, 732, and 734). If at step 718 the KIth element has not yet been sent, control is sent to be controlled at step 708 to proceed with the process.

If the "time-out" is reached in step 710, the number of code elements transmitted is checked in step 724. If no code element was sent in step 724, the procedure in step 726 would be lost and would have to be restarted in step 702.

However, if at least one element is sent and then a portion of the message is sent in step 728, it is checked whether or not some message sent in step 729 is sufficient. If some messages sent are considered sufficient, the process proceeds by a response / polling procedure in steps 730, 732, and 734.

9 to 12 are responsible for the special case of a disconnected caller calling a disconnected receiver, FIGS. 10 and 12 deal with the case of a disconnected active message portion for transmitting a message to the disconnected receiver, and FIGS. 9 and 11 from the disconnected active message portion. It deals with the case of a disconnected receiver receiving a message. This special case is specific to intelligent network manipulation.

Unlike the typical case of messaging between multiple lines and single line communicators, encoding and decoding number line numbers in a call-based or unresponsive order, and in special cases of messaging between single line communicators, the messaging code element is called "ring Based on the time period elapsed from the receiver's clock trigger until the process is released. When this special case is limited to intelligent network operation only or to communication between two and two restricted parties, the caller identification code is extracted directly from the call. However, since each message code can be based on many elements, the decoding of the link between the call and the message code is summarized as a multi-step procedure as follows:

(a) Caller Identification Code and Message Arrival Time from Call.

(b) Measure the time from the first ring to the end of the ring process.

(c) distributing the time measured by the decoding parameter TD, and distributing the distribution result to the nearest message code element value (e.g., assuming that the time from the clock trigger to the last ring is 7.5 seconds, available message Assuming the code element is 1, 22, 4, 6, 8, and then extracting the resulting element message code value by assuming that the extracted message code element value is 2).

(d) if appropriate, assigning the index i to the message code element based on the message arrival time and the previously received message code element (ie, the (i-1) th element).

(e) Know the number of elements that make up the message code and decode the message if all message code elements are available, or partially decode the message if "time-out" interrupts this procedure.

(f) If the receiver is a passive message part-generates a response code ("busy" signal) for a predetermined period of time after receiving the last code element, and does not generate a response code whenever it is not appropriate ("free"). signal).

(g) if the receiver is an active message part-by generating a ("busy" signal) or ("free" signal) as in step (f), the sender may be Hoham.

According to the decoding procedure described above, the encoding of the access free time message by the sender is as follows:

(i) Select the message code from the database per event (each code element has two parameters, the first is the number called and the second is the time from clock trigger to disconnect).

(ii) call the recipient number of the first code element (top element) and wait for the "ringing" mode for the time period defined by the particular code element.

(iii) release the call.

(iv) repeating steps (ii) and (iii) for the remaining code elements.

(v) complete the transmission of the coded message and proceed with a response as specified in step (f) or (g).

Consider a one-wire active message part that queries the multi-line active message part via polling. The multi-line active message portion can respond to many active message portions, one at a time.

In good network operation, the first step of polling data from the active message part calls the polling registration line of the passive message part for the purpose of identifying the caller to the passive message part, thus preparing the message code associated with the particular caller. By accessing the passive message section and switching the polling line to "polling", it is blocked to other concurrent callers. If there is a waiting message for the current caller, the response line switches to "busy", indicating the query caller on which the message is waiting. If there are no messages waiting, the procedure will end for both the active and passive messages.

The message encoding is made as a binary code using the "busy" and "free" states of the N lines inputted in the passive message portion. If N is too small to encode a full-duplex message code, the upper bits are encoded in the first cycle (the most significant bit is called the first line), and the lower bits are encoded in the last cycle (the least significant bit is called the last line). Where multiple consecutive cycles are used. In this case the active message portion will signal the passive message portion that the cycle has been completely read by calling the response registration line, and the passive message portion will in response encode the N lines of the next cycle. When the procedure is completed or terminated according to the "time-out", all receiver lines are switched to "free" so that the next message procedure can be initiated.

The difference between intelligent network operation and conventional network operation is that conventional network operation must be initiated by the caller identification encoding by the active message part before the receiver encodes the message code. As intelligent network operation, caller identification is typically modulated with the carrier frequency of the communication signal transmitted over the telephone network between the first and second input rings, while directly by a modem or line interface connected to the receiver line called by the caller. Extracted.

The procedure for polling a message code from a multi-line receiver by a disconnected caller is shown in Figures 13 and 14 and will be described below.

First, Figure 13 illustrates the basic steps of multi-line receiver logic for message code polling by a disconnected caller (active message portion). In step 800, the caller is identified by calling the polling registration line of the manual message part. In step 802, the multiple call receiver is approached and the polling line is switched to " busy " to block the concurrent caller. If there is a message currently waiting for the caller (step 804), the answer line switches to "busy" for T seconds at step 806, thereby prompting the caller with the message waiting.

If at step 808, the active message portion calls the recipient's response line within T seconds, at step 810, a " time-out " procedure is initiated. If there is no message currently waiting for the caller in step 804, then the caller waits for T seconds and control is transferred to step 836. Similarly, if the active message portion does not call the recipient's response line within T seconds, then control is transferred back to step 836 at step 808. At step 836 the polling procedure ends and all receiver lines, including polling and message code registration lines, are set to "free". The polling procedure is restarted and open to all callers.

As pointed out above, message encoding is generated as binary codes in the " busy " and " free " state of the N lines entering the passive message portion. Initially, all N lines inputted are set to "free". In step 812 it is checked whether the number of code elements K (binary bits) containing the message code is greater than or less than N. If K <N, the number of lines is large enough to encode and the message code required in step 840 is formed by switching L of the N lines to "busy". If the "time-out" is not reached when a check is made, then in step 834, if the caller called the recipient's reply registration line, the message was successfully polled.

In step 812, if K &gt; N is found, then N circuits are not sufficient to enable encoding of the full binary message code. In this case, the message code is divided into a number of consecutive cycles. The amount [K / N] +1 determined at step 814, where [X] represents an integer value of x, is the number of consecutive cycles required.

The loop provided by steps 818 to 832 is a message in cycle J with a predetermined scan time that allows the caller enough time to call the incoming and incoming receiver line for each cycle for which the cycle's message code was read. Describe the encoding of the code. Again, if the procedure ends due to a "time-out", all receiver lines are switched to "free" to begin the next messaging procedure (step 836).

Next, look at Figure 14, which illustrates the principle steps of single line caller logic for a message code polling from a multi-line receiver. In step 900, a trigger is set on for the single line active messaging caller to poll for messages from the multi-line receiver. At steps 902 to 906, the polling registration line of the receiver is called until it is "free". In step 908, the caller waits for T1 seconds, then disconnects, and then in step 910 calls the response registration line of the receiver. In step 912, the status of the response registration line of the receiver is examined. If the line is "free", there is no message waiting for the caller and the procedure ends at step 914. If the line is "busy", there is a message waiting for the caller, and a "time-out" procedure is initiated at step 918.

In step 920, the maximum number K of code elements is compared with the number N of receiver ingress lines. If K <N, then the number of incoming receiver lines is large enough to hold the end message code, and control passes to step 922, where line index i is set equal to zero, and the polling procedure for one cycle polling procedure is initiated. do. In the loop defined by steps 924 to 936, the message code is polled line by line as follows. First, the line index i is set to 1, the ni-th line of the receiver is called (step 926), a check is made on the state of the line (step 928), and if "free" (step 930), the call is made. Sleep waits for T2 seconds before disconnecting. After disconnection, an investigation is made to see if the last coded line was called (step 934). If the last coding line was not called, then a check is made for "time-out" (step 936). If no "time-out" is reached, control returns to step 924 and the next coding line is called. When the "time-out" is reached, the message code is only partially polled and the partial acknowledgment message code is prepared by the caller (step 938). On the other hand, in step 934, if the last coding line has been called, the message code is completely polled and the caller properly approves successful termination of the polling procedure in steps 940-948.

In step 920, if K> N is found, then N receiver lines are not sufficient to hold an end message code. In this case, the message code is divided into a number of consecutive cycles, where J defines the number of cycles needed to poll the message code. Steps 956 to 980 are the same as steps 924 to 946 for polling one cycle of messages. However, for steps 956 to 980, steps 950 to 954 and steps 982 and 983 are added which cause a single cycle polling procedure to be repeated J times.

The invention has been described and illustrated with some specificity. However, various changes and modifications may be made without departing from the spirit or scope of the claims.

15 and 16 illustrate an example of one line that performs a service for message transmission between a transmitter and a receiver mainly using the CEIC scheme of the present invention, that is, an LSP constituting a code element assigned to an IDC value. As it is, this is only one of various modifications according to the present invention.

15 and 16 are generally identical to FIGS. 11 and 12 except for minor modifications. The modified block is denoted by the same reference numeral as the corresponding block of FIGS. 11 and 12 by giving an apostrophe '. Since the remaining blocks are the same, a description thereof will be omitted. First, referring to FIG. 16, a transmission sequence is shown, in which the code element consists of the MSP and LSP elements as well as the code element for the ringing time. Each element represented by the LSP value is added for a transmitter-side single MSP number of transmitter IDC transmitted on the network. The entire process continues as described with respect to FIG. 12 except that the EIC code elements MSP and LSP are sent to the receiver if the time-out has not expired (block 712 ').

FIG. 15 is similar to FIG. 11, and the procedure for receiving the combined MSP and LSP is initiated at block 600 ': In block 634', the MSC element i is defined according to the acquired code element LSP _i and code element TR _i . [Thin line is assumed to be on]. If a session has just been initiated, the extracted LSP _i and TR _i constitute a first LSP and a ringing time element, respectively, and a time-out counting the session is triggered. Of course, not all calls require both LSP and Ti ringing period elements, but for convenience, consider the following example where only LSP and ringing period code elements are considered.

In the first ring, an LSP ₁ code element and a T ₁ code element are obtained. An LSP ₂ code element and a T ₂ code element are obtained in the second ring, and an LSP ₃ code element and a T ₃ code element are obtained in the third ring (T ₁ , T ₂ , T ₃ need not be different from each other and LSP ₁ , LSP ₂ , LSP ₃ as well).

The three LSP code elements form part of the code part, and likewise the three ringing periods form part of the code part of the code corresponding to a given message (e.g., a message from a set of messages that can be extracted using the LUT). do. As mentioned above, the order in which code elements are encoded can be important in determining the corresponding message, if necessary. Thereby, for example, LSP ₁ T _{1 in} the first call; The second sequence of LSP ₂ T ₂ at the time of the call at the time of the _second LSP No. 1 T _2; This message is different from the sequence of LSP ₁ T ₁ in the second call.

If necessary, other parameters of the caller's phone line and the receiver's phone line may be used to further increase the number of combinations that clearly increases the repertoire of messages.

Note that the same combination may correspond to different messages for each caller (or recipient). Thus, for example, LSP ₁ T ₁ for one recipient corresponds to the first message, while the same combination LSP ₁ T ₁ for another recipient corresponds to the second message.

Claims (72)

A method for communicating between a caller and a receiver through a telephone network, (a) the caller making at least one call from the at least one caller's telephone line to the at least one called telephone line; (b) the code is passed between the caller and the receiver by the receiver receiving the at least one call but not responding; And (c) determining a message from the code passed in Communication method comprising a. 2. The method of claim 1, wherein said codes are conveyed by recipient noting to which the recipient's telephone line is called and, if more than one line is called, they follow the order in which they are called. 2. The method of claim 1 wherein the code is communicated by the called party from a caller's telephone line generating at least one call and in the order in which the calls were made when one or more calls were made. 2. The method of claim 1 further comprising the step of preparing at least one recipient telephone line in a given state, wherein the code is communicated by the caller paying attention to the state of the at least one recipient telephone line. 5. A method as claimed in claim 4, wherein the given state of the called telephone line is selected from the group comprising busy and free states. 2. The method of claim 1 wherein the call is received at a first time value and the code is communicated by a recipient short-term that the recipient's telephone line is called with an elapsed time between the first time value and the disconnection. 2. The communication of claim 1, wherein the call is received at a first time value and the code is communicated by a recipient short from the caller's telephone line generating at least one call with an elapsed time between the first time value and the disconnect. Way. 7. The method of claim 6 wherein the first time value is the time at which the clock trigger of the call occurs. The method of claim 1, wherein the telephone network is an intelligent network. The communication method according to claim 1, wherein said telephone network is a conventional network. 10. The method of claim 9, further comprising providing a caller identification code that is automatically transmitted on a communication signal transmitted over a telephone network when the caller calls and can be automatically decoded from the communication signal. 11. The method of claim 10, further comprising the step of providing a caller identification code provided by the caller to the caller call recipient telephone line indicating the caller identification code. In a communication method using a telephone network and a telephone call is generated but not answered, The caller originating at least one telephone call, whereby at least one telephone line is called; A receiver receiving at least one telephone call without answering the call; And Associating at least one caller of the caller to a telephone number that is called but not answered by the recipient with a predetermined code, the code indicating an identification message; Communication method comprising a. In a communication method using a telephone network and a telephone call is generated but not answered, The caller originating at least one telephone call, whereby at least one telephone number is transmitted; Receiving at least one telephone number in response to the transmitted at least one telephone number without responding to the generated at least one telephone call; And Associating the received at least one caller phone number with a predetermined code indicating an identification message Communication method comprising a. In a communication method using a telephone network, a telephone call is generated but not answered, the telephone line status determines authentication for the continuation of the communication method, and if the telephone line status is an "authentication-continuous" state, then the communication method is authenticated. The active caller calls at least one unanswered telephone call upon receipt of an " authenticated-persistent " state to the at least one called telephone line; The active caller calls at least one unanswered series of telephone calls to at least one called line; And Notifying the telephone line status of at least one unresponsive series of telephone calls to obtain a series of statuses indicating a message code, said code indicating an identified message; Communication method comprising a. A communication method utilizing an existing telephone network, wherein a telephone call is generated but not answered, and generates a code-element of a time-coded message with a called line number from a first time value up to a call disconnection. The caller originates at least one telephone call such that at least one telephone line is called but not answered; Receiving at least one telephone call without answering the call and notifying the time from the first time value until the call is disconnected; And Associating at least one call of the caller to the telephone number called but not responding to the recipient, with a time notified from the first time value until disconnected, with a predetermined code, wherein the code indicates the identified message. Communication method comprising a. A communication method using a telephone network, wherein a telephone call is generated but not answered, and generates a code-element of a time coded message with a call line number from a first time value up to a call disconnection. The caller originating at least one telephone call, whereby at least one telephone line is called; Receiving a at least one telephone number in response to the transmitted at least one telephone number, not responding to the generated at least one telephone call, and notifying the time from the first time until the call disconnection; And Associating at least one caller's telephone number with a predetermined code, the code indicating an identified message, together with the time informed from the first time until disconnection. Communication method comprising a. 17. The method of claim 16 wherein the first time value is the time at which a clock trigger of a call occurs. A system for communicating between a caller and a receiver through a telephone network, (a) means for the caller to make at least one call to at least one called telephone line on at least one called telephone line; (b) means for passing the code between the caller and the receiver by the receiver receiving at least one call but not responding; And (c) means for determining a message from the code passed in Communication system comprising a. 20. A communication system according to claim 19, wherein said codes are carried by the called party's called party, and if more than one line is called, they follow the order in which they were called. 20. A communication system according to claim 19, wherein said code is carried by a called party from a caller's telephone line generating at least one call and in accordance with the order in which one or more calls were made. 20. The communication system of claim 19, further comprising the step of preparing at least one recipient telephone line in a given state, wherein the code is communicated by the caller paying attention to the state of the at least one recipient telephone line. 23. The communication system of claim 22, wherein the given state of the called telephone line is selected from the group comprising busy and free states. 20. The communication system of claim 19, wherein the call is received at a first time value and the code is conveyed by a recipient short-live with the recipient telephone line being called with the elapsed time between the first time value and the disconnect. 20. The communication system of claim 19, wherein the call is received at a first time value and the code is communicated by a recipient short from a caller's telephone line generating at least one call with an elapsed time between the first time value and the break. . 25. The communications system of claim 24 wherein the first time value is the time at which the clock trigger of the call occurs. 20. The communication system according to claim 19, wherein said telephone network is an intelligent network. 20. The communication system according to claim 19, wherein said telephone network is a conventional network. 28. The communication system of claim 27, further comprising a network that is automatically transmitted on a communication signal transmitted over a telephone network when the caller calls and provides an identification code that can be automatically decoded from the communication signal. 29. The communication system of claim 28, further comprising a caller providing a caller identification code provided by a caller call recipient telephone line pointing to the caller identification code. In a communication system using a telephone network and a telephone call is generated but not answered, Means for the caller to make at least one telephone call so that the at least one telephone line is called; Means for receiving at least one telephone call while the called party does not answer the call; And Means for associating at least one caller of the caller with a predetermined code, wherein the code represents the identified message for a telephone number that is called but not answered by the recipient Communication system comprising a. In a communication system using a telephone network and a telephone call is generated but not answered, Means for sending at least one telephone number by the caller originating at least one telephone call; Means for receiving at least one telephone number by a receiver in response to said at least one telephone number transmitted, without responding to said generated at least one telephone call; And Means for associating the received at least one caller phone number with a predetermined code indicating an identification message Communication system comprising a. In a communication system using a telephone network, a telephone call is generated but not answered, the telephone line state determines authentication for communication continuity, and the authentication is made if the telephone line state is "Authentication-Continuous". Means for an active caller to call at least one unanswered telephone call upon receipt of an "authentication-persistent" status to the at least one passive caller telephone line; Means for the active caller to provide a series of at least one unanswered telephone call to the at least one passive caller telephone line; And Means for detecting a telephone line condition of said at least one unanswered telephone call and obtaining a series of status indicative of a message code indicating an identification message; Communication system comprising a A communication system using an existing telephone network and generating a code element of a message coded by a called telephone line number and a time until the call is disconnected at a first time value, without a telephone call being generated but not responding to, Means for the caller to make at least one telephone call, calling at least one telephone line but not answering; Means for receiving at least one telephone call without answering the call by a receiver, and detecting a time from the first time value until the call is disconnected; And Associating a telephone number called by the at least one call from the caller to the recipient but not answered, and the time detected until the call is disconnected at the first time value with a predetermined code indicating an identification message. Means for Communication system comprising a A communication system using a telephone network, wherein a telephone call exists but does not answer, and generates a code element of a message coded by a call telephone line number and a time from the first time value until the call is disconnected, Means for the caller to provide at least one telephone call to call at least one telephone line; Receive the at least one telephone number by the receiver in response to the transmitted at least one telephone number, without responding to the provided at least one telephone call, and determine the time until the call is disconnected at the first time value. Means for sensing; And Means for associating the received at least one caller phone number and the time from the first time value until the call is disconnected with a predetermined code representing an identification message Communication system comprising a 35. The communications system of claim 34 wherein the first time value is the time at which a clock trigger of a call occurs. An active messaging party for message code transmission, for use in a system according to claim 19. Passive messaging party for preparing a message code for receiving and polling a message code for use in a system according to claim 19. 20. An apparatus for requesting status reporting of at least one status for use in a system according to claim 19. An automatic point of service requiring a status report selected from at least one of the type and quantity of inventory and service required for the automatic point of service and the automatic point of service required for repair, for use in the system according to claim 19. . Manual point of service requiring a status report selected from at least one of the type and quantity of inventory and service required for the manual point of service and the defect and failure of the manual point of service required for repair for use in the system according to claim 19. . A utility meter that requires status reporting of values read from the utility meter for use in a system according to claim 19. 20. Apparatus for application to a device having a predetermined state for use in a system according to claim 19, causing a device state change. Applied to a device with a predetermined state for use in the system according to claim 19, causing a change in the predetermined state, the device being selected from at least one of a group comprising for example a water valve, a traffic light, a current switch and a smart house controller. Controller command. A method for transmitting a selected encoded message from at least one set of messages in an intelligent telephone network from at least one call side telephone line to at least one receiving side telephone line, (a) at the call side, encoding the message to include at least one code portion that transmits to the intelligent telephone network; (b) routing the encoded message by at least one call from at least one of the call side telephone lines to at least one of the receiving side telephone lines; And (c) at the receiving side, receiving at least one call but decoding the encoded message therefrom without responding to it; Message transmission method comprising a. 46. The method of claim 45, wherein said code portion specified in step (a) consists of at least one code element from the at least one call being a least significant valid portion (LSP) appended to an extension identification code portion of a call. 47. The method of claim 46, wherein the LSP of each element is attached to either a caller extension identification code (CEIC) or a receiver extension identification code (REIC). 46. The method of claim 45, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one element that is an elapsed time set between a first time value for disconnection of the call from the at least one call. A message transmission method that includes. 46. The method of claim 45, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one code element that is a telephone line from the at least one call telephone line. 46. The method of claim 45, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one code element that is a telephone line from said at least one receiving telephone line. 46. The method of claim 45, wherein encoding the message specified in step (a) is order sensitive. 46. The method of claim 45, wherein encoding the message specified in step (a) is not order sensitive. 46. The method of claim 45, wherein the message encoded in step (a) is in accordance with the receiver. A system for transmitting a selected encoded message from at least one set of messages in an intelligent telephone network from at least one call side telephone line to at least one receiving side telephone line, (a) at the call side, an encoder for encoding the message to include at least one code portion that transmits to the intelligent telephone network; (b) a router for routing the encoded message by at least one call from at least one of the call side telephone lines to at least one of the receiving side telephone lines; And (c) a receiver for receiving at least one call and decoding a message encoded therefrom without answering the call; Message transmission system comprising a. 55. The system of claim 54, wherein the code portion specified in step (a) consists of at least one code element from the at least one calls being a least significant valid portion (LSP) appended to an extension identification code portion of a call. 56. The system of claim 55 wherein the LSP of each element is attached to a caller extension identification code (CEIC) or a receiver extension identification code (REIC). 55. The method of claim 54, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one element that is a set of elapsed time between first time values for disconnection of the call from the at least one call. Including a message transmission system. 55. The system of claim 54, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one code element that is a telephone line from among the at least one call telephone lines. 55. The system of claim 54, wherein encoding the message specified in step (a) further comprises a code portion consisting of at least one code element that is a telephone line from said at least one receiving telephone line. 55. The system of claim 54, wherein encoding the message specified in step (a) is order sensitive. 55. The system of claim 54, wherein encoding the message specified in step (a) is not order sensitive. 55. The system of claim 54, wherein the message encoded in step (a) is in accordance with the receiver. 55. The method of claim 54, At the call side, an encoder for encoding the message to include at least a portion of code passing through the intelligent telephone network; And A router for routing a message encoded over at least one call from at least one of the telephone lines of the calling side to at least one of the telephone lines of the receiving side. Message transmission system comprising a. 55. The system of claim 54, comprising a receiver at the receiving side that receives at least one call but does not respond and decodes the encoded message. 20. The system of claim 19 using a cost related message. 32. The system of claim 31 using a cost related message. 33. The system of claim 32, using a cost related message. 34. The system of claim 33 using a cost related message. 35. The system of claim 34, using a cost related message. 36. The system of claim 35, using a cost related message. 46. The system of claim 45 using a cost related message. 55. The system of claim 54, wherein a cost related message is used.