UA74790C2 - Method and device for concurrently processing several signals in a spread-spectrum communication system - Google Patents

Abstract

Techniques to enable the processing of multiple calls in a spread spectrum communications system (100). The call processing state machines defined by the CDMA standards (e.g., IS-95 and IS-2000) are modified to include a "traffic channel" substate indicative of the mobile station (106) processing at least one active call. Call control (CC) state machines of various types are also provided to control the processing of the calls. To process one or more calls concurrently, a CC state machine is instantiated upon receiving an indication to process a particular call. The instantiated CC state machine is identified with, and used to control the processing of, the particular call. Upon receiving an indication to process an additional call, another CC state machine can be instantiated for the additional call. Correspondingly, upon receiving a directive to release a call, the call and its instantiated CC state machine are released.

Description

Description of the invention

The invention relates to wireless communication, in particular, to a method and device for simultaneous processing of many 2 communication sessions in a spread spectrum communication system.

Modulation with the use of parallel access with code compression of channels (PDKU) is one of the methods that make it possible to establish communication for a large number of system users. Other known ways of providing parallel access are time-division parallel access (TDMA), frequency-division parallel access (FDMA), and amplitude modulation schemes, for example, with one 70 companded sideband. Modulation with PDKU, however, has significant advantages over other systems.

The use of PDCU in parallel access communication systems is described in US Patents 4,901,307 and 5,103,459, which are incorporated herein by reference.

PSC systems are usually aligned with one or more PSC standards, such as standards

TA/ETA 15-95-А and I5-958 ("Compatibility standard of mobile and base stations for wide-band systems of 12 two-way extended spectrum communication", hereinafter - simply IZ-95), TIA/EIA 15-98-А, - B, -C (Recommended minimum standard for dual-mode cellular and PO5 mobile stations) and sata?2000 ("5-2000) for extended spectrum systems.

Each of these standards defines the mechanism of processing one communication session between mobile and base stations. This mechanism is defined by a finite state machine for processing a communication session at the signaling level (ie, level 3), which can have a certain number of states and a set of allowed transitions between states. Each state of the finite state machine corresponds to a certain state of the mobile station (MS) or base station (BS) in the process of processing a communication session. The transition to a new state occurs under the condition that certain events occur.

Initially, PADKU systems were intended to provide voice communication. Therefore, finite automata for processing a communication session, defined by the standards of PDKU, were intended for processing only one communication session, which is typical for voice communication. In systems that comply with a certain standard of PDKU and are intended for the realization of a finite automaton of communication processing defined by this standard, processing of only one communication session at a time is assumed and a new communication session cannot be processed before the end of the active session . This imposes restrictions on the types of services that can be provided to the user.

It is highly desirable to expand the communication service beyond the limits of only voice or only information communication. Such improved service often depends on the system's ability to support multiple He! communication sessions. For example, the ability to simultaneously transmit a voice and video signal (in two simultaneous communication sessions) makes it possible to hold video conferences. In some cases, it becomes necessary to transmit both voice and data at the same time (for example, to transfer a file while having a conversation). "AND

Therefore, there is a need for simultaneous processing of multiple communication sessions in a broadband environment.

The object of the invention is to create a method of processing multiple communication sessions in a wide-spectrum communication system. This task is solved by modifying (or re-defining) the finite state machine for processing the communication session of the PDKU standards through the inclusion of a substate that indicates that the MS is processing at least one active communication session. The invention also includes session control finite state machines (CS) of various types for managing the processing of associated communication sessions. According to an embodiment, one finite state machine KS is immediately C 50 initiated to process each communication session, and the initiated finite state machine KS is turned off after the release of the associated session. Finite automaton | processing level C (Fig. 5) is general finite

With" automaton 500, and the finite automaton KS is a finite automaton for voice, data, IZOM and O5M, which is initiated for each communication session.

The embodiment of the invention provides a method of processing one or several communication sessions simultaneously in a wide spectrum communication system. According to this method, an indicator of the need to process a certain communication session is received, and the CS finite automaton for this session is immediately initiated, after which this finite automaton "" is identified with a specific communication session and is used to control it. After that, the transmissions related to this session are exchanged. After receiving a message about an additional communication session that should be processed, another finite automaton of the CS can be initiated for this session. Accordingly, after (Te) 20 receiving an instruction to release a certain communication session, this session is released, and the corresponding finite state machine is stopped. According to an embodiment, each communication session to be processed is associated with a specific communication with a type of service that includes information about a set of parameters (ie, physical channels) to be used for data transmission.

The initialized finite state machine can be of a certain type depending on the type of communication session being processed. 52 For voice, information, video, fax communication sessions and IZOM, OM, etc. sessions. you can

GF) to use different finite automata KS. In one of the embodiments, the finite automaton CS for voice includes: (1) waiting for a command substate, which indicates to wait for an order from the BS, (2) waiting for a response substate, which indicates to wait for a user response to a specific call, (3) a conversation substate , which indicates the period of allowed voice transmissions of the communication session, and (4) a release substate, which indicates to terminate the voice communication session. 60 Another embodiment of the invention relates to a method of simultaneously supporting two or more communication sessions in a communication system. According to this method, a message about the first communication session (Sa d) to be processed is received. The first connection for selecting the type of service (SO Sopp 3) of data transmission is defined and a group of one or more communication channels associated with the selected type of service is assigned. The first communication session is mapped to the first connection that defines the type of service, and the finite state machine KS 62 is immediately initiated to control the processing of this communication session. For each subsequent communication session to be processed, a separate CS finite automaton can be initiated. After receiving a directive to release a certain communication session, this session is released and the initiated finite state machine is stopped.

If it is necessary to simultaneously process several communication sessions, one or more additional service-defining connections may be defined. Each active communication session is mapped to one of these connections. When releasing a communication session, it is determined whether the connection of the newly released session is used by at least one active communication session. If the connection defining the type of service is not in use by any active communication session, it is released. Similarly, if such a connection is released, a determination is made whether the physical channels 7/0 of the newly Released connection are being used by other service type-defining connections. A physical channel is released if it is not in use by any such connection.

Another embodiment of the invention relates to a method of processing two or more communication sessions in a spread spectrum communication system. According to this method, a certain communication system is selected for use and the pager channel is monitored to detect an exciting message about an incoming call. For each of the communication sessions to be processed, one or more physical data channels are assigned and the CS finite state machine is immediately initiated. The exchange of messages during the communication session is carried out in the designated physical channels. After receiving an instruction to release a certain communication session, the initiated finite state automaton CS is released, another embodiment involves a mobile device that has a controller connected to the receiving and transmitting nodes. A receiving node receives incoming messages, and a transmitting node transmits outgoing messages. A controller receives a message that a particular communication session is to be processed and immediately initiates a CS finite state machine for that session and exchanges one or more messages related to that session through the transmitting and receiving nodes, the initiated CS finite state machine is identified with and manages this communication session. The controller may receive a message that an additional communication session is to be processed and initiate a CS finite automaton for this additional session. The controller can also accept a directive to release a certain communication session and, accordingly, release the finite automaton CS for this session. (8)

Features, principles and advantages of the invention can be revealed from the following detailed description with reference to the drawings, in which:

Fig. 1 - scheme of the extended spectrum communication system for many users, Fig. 2 - block diagram of the implementation of the main subsystems of the system,

Fig. 3 is a finite state machine for processing a communication session in MS, Me

Fig. 4 - a finite state machine for controlling the MS in the state of the information channel, M

Fig. 5 - a finite state machine for simultaneous processing of many communication sessions in the MS,

Fig. 6 - mapping scheme between some sublevels of level C according to the invention, "

Fig. 7-16 - communication diagrams between MS and BS for establishing, processing and releasing a communication session under different conditions.

Fig. 1 contains a diagram of a wide spectrum communication system 100 that serves a significant number of users. System 100 provides communication for cells 1022-1029, each served by a respective

BS 104. Numerous MS 106 are scattered in the system, each of which can communicate with one or more BS in forward and reverse channels, depending on whether the MS is in a state of soft transmission of communication. According to Fig. 1, BS from c 104a transmits data to MS 10ba, 106 | in the direct channel, BS 1046-to MS 1066B, 106), BS 104s-to MS 106s, etc. The solid line with arrows shows the transmission from the BS to the MS, the dashed line with arrows shows that the MS and? receives a pilot signal from the BS, but not data. The return channel is not shown for simplicity.

Each MS, especially those near the cell boundary, can receive data and/or pilot signals from

A few BS. If the measured pilot signal from a certain BS exceeds the predetermined level, the MS may request that this BS be added to the active group of this MS. Each MS can receive transmitted data from several P members of the active group (or not receive from any). ve Fig. 2 contains a block diagram of the implementation of the main subsystem of the system 100. The switch 110 of mobile devices -I (KMP) has a connection with the interface 224 of the packet network, RTM 230 and BS 104 (in Fig. 2 only one BS 104 5r is shown for simplification). KMP 110 coordinates communication in system 100 between MC 106 and other users having an IC connection with packet network interface 224 and RBTM 230. RBZBTM 230 communicates with users through a standard telephone network (not shown).

KMP 110 includes a number of selector elements 214, one of which is assigned to control communication between one or more BS 104 and one MS 106. If the selector element was not assigned to MS 106, the processor 216 dv Communication session management informs about the need for a paging call MS 106.

The data source 220 contains the data intended for transmission to the MS 106 and sends this data to the packet network interface 224 (F), which directs this data to the selector element 214. The element 214 sends this data to each connected BS with MC 106. Each BS 106 supports a queue of 240 data intended for transmission to MC 106.

In the direct channel, the data is packed and formatted together with other control and code bits and then encoded. Depending on the specific physical layer in the PSC system, the coded packet can be demultiplexed into parallel streams and transmitted in one or more Walsh channels.

Data is sent in packets from queue 240 to channel element 242, which adds the necessary control fields to each packet. Data, control fields, check bits, and code tail bits form a formatted packet. Next, channel element 242 encodes one or more formatted packets and interleaves (reorders) the 65 symbols in the encoded packets. The interleaved packet is scrambled with a scrambling sequence, covered with Walsh coatings and extended with a long pseudo-noise code (PSN) and short PSI and PSHO codes.

The extended data is quadrature modulated, filtered and amplified by the radio frequency (RF) transmitter of the node 244. The forward channel signal is transmitted by the antenna 246 in the forward channel 250. The channel scheduler 248, which is present in each BS 104, coordinates communications between the MS 106 and one or more BSs 104.

In MC 106, the direct channel signal is received by the antenna 260 and directed to the receiving node of the input stages 262. This node filters, amplifies, quadrature demodulates and quantizes the signal and sends the digitized signal to the demodulator 264, where it is collapsed with a long PSH code and short codes PSI, PSO) , is revealed by a Walsh cover and descrambling with an identical scrambling sequence. The demodulated data is sent to the decoder 266, which performs the reverse functions of the processing functions of the BS 104 (for example, performs reverse 70 interleaving, decoding, and frame verification). The decoded data is sent to the data consumer 268 .

The described equipment transmits data, messages, voice, video and other types of data in a direct channel, or generally "data".

System 100 provides data transmission from MS 106 to BS 104 in the reverse communication channel. In the MC 106, the controller 276 processes the data intended for transmission and directs it to the encoder 272. The controller 276 can be implemented as a microcontroller, microprocessor, digital signal processing chip (DSP) or AIS adapted to perform the mentioned functions.

Encoder 272 encodes data according to a "pause-packet" format (see US Patent 5,504,773, incorporated by reference).

Encoder 272, in addition, forms and adds a set of KCN bits and tail bits, encodes the data and rearranges the symbols of the encoded data. The interleaved symbols are sent to the modulator (MOD) 274.

The modulator 274 can be implemented in many ways. The interleaved data is covered by Walsh codes, extended by a long PSH code and short PSHI, PSHO codes). The expanded data is sent to the input stages transmitter node 262, which modulates the data, performs filtering and amplification, and transmits the return channel signal through the antenna 246 in the return channel 252.

In the BO 104, the return channel signal is received by the antenna 246 and directed to the RF node 244. This node filters, amplifies, demodulates and quantizes the received signal and sends the digitized signal to the channel element 242, which collapses it with short PSI, PSO and long PSO codes and collapses with the proper code (8)

Walsh. Next, element 242 re-orders the collapsed data and performs a check on the KCN. The decoded data (voice, video, information or message) is sent to the selector element 214, which directs it to the addressee. The channel element 242 can send to the selector element 214 a quality indicator that indicates the quality of the received data packet.

A description of the physical layer used for data processing according to I5-95 can be found in the already mentioned Me patent 5103459, and a description of the physical layer of other PDKU systems in US patent application 08/963 386 dated 3/11/1997, M incorporated by reference .

System 100 can be built according to any existing standard of PDKU and adapted to future standards. Each standard defines a mechanism for processing a communication session in the MO. Cha

Fig. 3 illustrates a finite automaton Z00 for processing a communication session for MS, which complies with the standards (|5-95-A and

I8-2000. Upon power-up, the MS enters an initialization state 312 where it selects a system to use. If the selected system is analog (for example, ZZM or PDRU), the MS enters state 314, which corresponds to operations in analog mode. If the PDCU system is selected, the MS receives access to the selected PDCU (that is, to one or more BSs) and synchronizes with it. After receiving access and time parameters of the PDKU system, the MC goes into the rest state 316.

In state 316, the MC is enabled but not active. The MC monitors the pager subchannel of the direct communication channel;" in search of messages from BS. If the MS cannot accept the paging channel or needs to add another BS to the active group (for soft handover), it returns to state 312 and gains access to the BS. In state 316, the MS can receive messages or incoming calls, initiate a call, perform registration, initiate -I transmission of a message, or perform other actions. After that, the MS goes to the system access state 318. In this state, the MS sends a message to the BS in one or more access channels to obtain access, and receives a message from the BS in the paging channel. The exchange of messages depends on the type of -I transmissions (for example, voice or information) passing between the MS and the BS, and on the origin of the message (from the BS or

From MS). Depending on the result of this exchange, the MS can return to the idle state 316, if there is no active IC communication, or go to the information information channel control state 320, if a call is to be processed. Before entering the 320 state, the MS receives the direct channel assigned to it for the communication session.

In state 320, the MS maintains communication with the BS in the designated forward and reverse channels. After the end of the communication session, the MS returns to state 312.

The finite state machine of Fig. 3 is described in the relevant standards of PDKU (for example, I5-95 and I5-2000), according to which each state shown in Fig. 3 includes a number of substates.

F) Fig.A4 illustrates a finite state machine for implementing the state of control in the MS of the information channel. After receiving the assigned information direct channel (state 318), the MS goes to substate 410 of state 320 to initialize the information channel. In this substate, the MS makes sure that it can receive forward channel data, starts transmitting reverse channel data, and synchronizes the forward and reverse channels. The MC performs a number of other functions in this substate (for example, power management correction). After that, the MS waits for confirmation of access to the direct channel from level 2 (in I5-2000 standard systems) or from the BS (in IZ-95 standard systems). If the MS receives a call from the BS, it goes to substate 412 of waiting for an order or to substate 416 of conversation, if the call was initiated in 5 MO.

In the substation 412, the MS is waiting for the Excitation in the Information Message from the BS. This message indicates how and when the MS should make the phone call. If the MS receives this message within a predetermined period (Tweet) after transitioning to state 410, it transitions to waiting for a response from the MS (substate 414).

In substate 414, the MS informs the user about an incoming call with a call according to the received Excitement in the information message and waits for a response from the user. After receiving an answer (for example, by pressing the "answer" button), the MS goes to the substate 416 of the conversation.

In this state, the MS exchanges signals with the BS through designated information channels and according to the selected connection, which determines the type of service. During an informational communication session or in the case of session initiation by the MS user, the user does not need to be informed about the call and the MS moves to substation 416 from 7/o substation 410. The MS remains in substation 416 throughout the communication session. If the MS receives a command from the user or an order to release from the BS, it enters the release state 418.

Substate 418 corresponds to the end of the communication session with the BS and the end of state 320 of information channel management. In state 418 , the MS confirms disconnection, after which it returns to the system definition substate in state 314 of initialization.

A detailed description of the finite state machines of Fig. 3, 4 can be found in the documentation of standards I5-95 and I5-2000 (Standard TK45 of upper-level signals (level 2) for extended spectrum sata2000 systems), included by reference.

The finite state machine of Fig.4 supports a single voice communication session between MS and BS. In particular, if the MS is in substate 416 of the conversation and another initiated was received. BS call, the MS will not be able to return to the 2o state 412 waiting for an order to inform the user about a new call. To return to state 412, the current communication session must be terminated and the MS must return to initialization state 312. Limitation to one communication session prevents the provision of additional services in PSC systems, for example, provision of video conferences, multiple services (for example, voice and video), etc.

Fig. 5 illustrates a finite state machine 500 for simultaneous maintenance of several communication sessions in the MS. high school

The finite state machine 500 can be used instead of the finite state machine 300 of Fig.3. It has a power-on state 510 , an MC initialization sub-state 512 , an MC idle state 516 , and a system access state 518 , which correspond to (8) a power-on state 310 , an MC initialization state 314 , an MC idle state 316 , and a system access state 318

Fig. 3. State 320 of the control of the information channel is replaced by the information state 520, which includes the substate 522 of the initialization of the information channel, the substate 524 of the information channel, and the substate 526 of release. o z States 512, 516, 518 are implemented similarly to states 312, 316, 318, respectively. , Information channel initialization substate 522 and release substate 526 are implemented similarly to substate 410 (Me information channel initialization and release substate 418, respectively (Fig. 4). M

After power-up, the MS selects a particular system, accesses the selected system, and synchronizes with it (state 512). After that, the MS monitors the paging direct channel (state 516) in search of messages from the BS and can initiate other actions (for example, receiving messages or an incoming call, registration, transmission of e-messages, etc.). After performing some of these actions, the MS sends a message to the BS in the access channel and receives a message from the BS in the paging channel (state 518) to establish an information channel for the communication session. Next, the MS enters state 520 and remains in this state as long as at least one communication session is waiting for it. After the release of all communication sessions, the MS returns to state 512 of MO initialization. "

After transitioning to information state 520 for the first communication session, the MS synchronizes with the information channel assigned to c (substate 522) and transitions to information channel substate 524, and after receiving an appropriate message (for example, Communication Session Establishment Notification) initiates a finite from the CS machine for this session. For example, the MS can initiate a voice finite automaton 530 KS for a voice communication session, an information finite automaton 540 KS for an information session, a finite automaton 550 KS IZOM for communication with the IZOM network, a finite automaton 560 KS O5M for communication with the network SOZM-I or another finite automaton CS for a communication session of another type. CS finite automata are used to control the processing of associated communication sessions. If another call is initiated or accepted in state 520, the MS immediately initiates another finite automaton KS-I for a new communication session. Each communication session is assigned a finite automaton CS for processing.

The CS finite automaton is used for direct control of the associated communication session and for processing and control messages of the corresponding communication session. Thus, at each moment there can be several (I) o finite automata CS (I -1, 2, 3, .... The MS remains in the information state 520 until all communication sessions waiting for it are exhausted. At the end of each communication session, the finite automaton of the CS of that session is released and the MS checks whether the released communication session is the last, if so, the MS enters substate two 926 release.

Finite automaton 500 (with states 510, 512, 516, 518 and 520) can be used to implement (F) a finite automaton of level Z for the PDKU system. The finite state machine 500 determines the interaction between the MS and the BS regardless of a specific communication session and can be used to simultaneously serve any number of communication sessions. Depending on the type of communication, finite state automata can be implemented in accordance with the requirements of the system. In addition, CS finite state machines can be added, removed, or modified (depending on the finite state machine 500) to provide a different and/or additional service. The use of many finite automata allows you to independently connect and release communication sessions.

Fig. 6 contains a scheme of mappings between some sublevels of the lower level C according to the invention. Layer C includes a sub-layer 612 of managing a communication session (CS), which is above a sub-level 614 of managing a selection of 65 services (KVO), which is above a sub-level 616 of managing radio resources (RR). Sublevel 616 of the CRC defines available physical information channels for data transmission. Sublayer 614 defines parameters for data transmission, for example, the type of multiplexing, power control, characteristics of the information direct communication channel, etc. Sublayer 612 defines communication sessions to be processed.

The communication session (Ca) is processed in the 612 CS sublevel and is mapped to a specific connection that determines the type of service (50 Soppu). According to Fig.b, Sad is displayed on BO Sopp., SaiYiv - on BO Sopp" and SaiYds - also on BO Sopp". indices A, B, C identify the communication sessions (SAG AND IB) to be processed, and indices 1, 2 define the link (SOM KER) to the connection that determines the type of service. and

Each connection defining a type of service identifies one or more physical channels for data transmission. According to Fig. b, BO Soppi is mapped (that is, uses it) to the specialized channel /o Control (OSSN) and to the auxiliary channel (ZSN), and 5O Sopp» is mapped to the main channel (ESN) and to the auxiliary channel (ZSN).

When joining each communication session, a new finite automaton CS (Sa!U) is initiated, the type of which is determined by the type of communication session to be processed (voice, data, IZOM, ZM, etc.). Each type of finite state automaton CS has substates corresponding to this type. The PDKU system can be constructed in such a way that /5 works with finite state machines of various types and assumes, if necessary, the addition of new types of finite state machines.

As shown in Fig. b, several communication sessions can be processed simultaneously. One or more communication sessions can be mapped to each connection defining the service type. According to I5Z-95, a mutually unambiguous mapping between a communication session and a 2o Connection, which determines the type of service, can be used for voice communication. In some cases, a reference to such a connection (ie SOM KER) can be used as an IO SAI. To create a mapping of several communication sessions to a connection that defines the type of service, the "communication session - connection" mapping is performed both in the MS and in the BOS. When a communication session associated with a particular service-defining connection is released, that connection is also released and the physical channel corresponding to that connection is released. high school

The service-defining connection (5O Sopp m) defines a set of data transfer parameters (service selection - ZO) and is identified by reference to this connection (COM KER m). These connections are local i) in MS and BOS.

The service-defining connection is determined by the "service negotiation" procedure. When the MS is in informational state 520 and there is a need for such a connection, the request for such a connection and its purpose are fulfilled through the service negotiation procedure. Examples of such a procedure can be found in the documentation of the I5-2000 standard. The invention includes other service coordination procedures. Me

In some embodiments, physical channels are assigned through service negotiation. In these embodiments, such M procedures may include requesting one or more new information channels and exchanging channel configuration information. After that, the required physical channels can be connected and distributed based on this information. After the completion of the service negotiation between the MS and the BS, the necessary physical channels are assigned and ready for transmission.

Several types of CS finite automata are assigned to serve different types of communication sessions.

Examples of such machines include:

Voice: Voice finite state machine KS is intended for voice, circuit data, and some other types of service. Schematic data is transmitted by circuits (that is, through specialized communication channels) intended for communication in a similar way to a voice communication session. Circuit data signals are transmitted out of band. Voice finite automaton KS is similar to the finite automaton for a communication session according to I5-95 (Fig. 4). ;" Packet data: the finite state automaton CS is designed to process data packets. The implementation of this finite state machine is determined by the needs of a specific PDKU system. One of the embodiments has such a finite automaton

Zero finite automaton CS (that is, an automaton without states), if the session control is carried out through -I data transfer.

IZOM: finite automaton CS of the IZOM type is intended for use in IZOM networks. в О5М-МАР: finite automaton CS of the О5M-МАР type is intended for use in О5BM-МАР networks. -I In the embodiment of Fig. 5, the voice finite automaton 530 KS includes four substates: substate 532 waiting for

Order, substate 534 of waiting for a response from the MS, substate 534 of conversation and substate 536 of releasing a communication session. se) Substates 532, 534, 536 generally correspond to substates 412, 414, 416 (Fig. 4). In the process of ending the voice communication session, the voice finite automaton of the CS goes into the state of release of the communication session. After the end of the voice communication session, the corresponding finite automaton of the CS is released.

In order to monitor communication sessions and process initiated finite automata KS serving several ov beans at the same time, each communication session is identified by a unique session identifier (CA! 1). SA |IO is "local" relative to MS "" KMP path and is chosen by the call initiator. The locality of the SAI IO allows iF) to use the same SAI IO in several MCs at the same time. SAII IO can be considered similar to "Sai ko Ketegepse" in IZOM or "Tgapzasiyup idepiyeg in SZM.

After assigning a CS finite automaton for a certain communication session, further transmissions of this communication session (for example, a Flash Information message) between MS and BS contain SAGI. And thanks to this, transmissions can be directed to the corresponding finite state automaton KS. SA! OO can be used for voiced finite automata KS (15-95) and other finite automata KS, if there are no ambiguities. In these cases, it is possible to generate signals according to the I5Z-95 standard and ensure compatibility with existing I5Z-95 systems. In the case of a single voice communication session or circuit data transfer or fax, only minimal (or no) changes may be required to add a field (possibly optional) to the corresponding message to identify the type of CS (Toure) finite state machine. In some embodiments, the information communication session may not use the IS (SAI) because the signaling messages are transmitted within the band.

CS finite automata are characterized by the ability to support several communication sessions per connection, similar to the IZOM network. Resources for such support are provided by KMP and such processing may be transparent to

MS. For example, IZOM assumes three-way communication sessions for conducting several communication sessions (SAII IS) in MO. In this case, the MS processes the existing communication sessions separately. However, in AM5)-41 wireless systems, existing communication sessions are handled separately by the KMP, and the MS uses a Flash Information Message to inform the KPM about a state change in a three-way communication session. The mechanism for handling multiple communication sessions for 70 connections is described in detail in TIA/EIA-664, incorporated by reference.

The invention can be applied with a slight modification of the finite state machine | communication session processing defined in I5-95 and I5-2000. After the transition from state 318 of MS access (Fig. 3, 4) to state 320 of managing the information channel, the MS moves to substate 410 of initializing the information channel in accordance with the standards

I8-95 and I5-2000. From substate 410, the MC moves to a new, newly defined state of the "Information Channel", which replaces substate 412 of waiting for an order, substate 414 of waiting for a response from the MC, and state 416 of a conversation. One or more timers can be associated with states 412, 414 to generate the necessary timeout messages provided by the current standards of PDKU.

Fig.7 contains a diagram of the exchange of messages between the MS and BS during the processing of the first voice communication session accepted by the MS and initiated by the KMP. In idle state 516, the MS receives General Paging on the paging channel

A message that contains a new type of ZO service. Next, the MS goes to the system access state 518 and responds with Pager Message-Response in the access channel. After that, the MC takes the Dismembered

A Channel Assignment Message (CAM) that contains the assigned physical channel. After receiving RPPC

MS goes to substate 524 of the information channel and in this | status accepts Installation Notice

Communication Session (PVSZ), which contains the type of finite automaton KS (SA Tour), the session identifier (SA IO,) of the 1st communication, which determines the type of service (SOM KER mu) for this communication session. In this case, SS Touré is vocal. After receiving the PVSZ, the MS immediately initiates the voice-type finite automaton KS 530. and)

In substate 532 waiting for an order, the MS informs the user about an incoming call (for example, by ringing) and waits for a response from him. In some embodiments, the PVSZ may be absent for the first call (i.e., SAII |O,i

SOM KERu have default values), and SS Toure is transferred to RPPC. In this case, the finite state automaton CS can be initiated after transition to substate 524.

Next, the MS performs service coordination procedures with the BS. At the same time, the MS accepts the Message-Demand of Me

Service (Air Defense) with a service configuration record (SCR), which includes the newly added service type - service ZO y. There is an exchange of several service agreement messages between the MS and BS, which also define the parameters of the communication session, which may include the number of the type of service. After the completion of the service negotiation, the MS receives a Service Connection Message (SMS), which includes the Service Connection Service with the newly added service type ZO y and SOM KER for the designated service-defining connection.

Coordination of service and assignment of the service-defining connection may occur prior to receipt of the PVSZ. In this case, SOM KER and PVSOZ correspond to the reference to this connection. "

After receiving the Excitement with an informative Message, which includes SA! OO in the communication session assigned to this pt"), the MS goes into substate 534 waiting for the answer of the MS. Next, the MS generates a call and waits for the user's response. After receiving this answer, the MS sends a Connection Order, which includes SAII |IO,, |and ;" goes into substate 536 I conversation and can exchange Flash Information Messages with BS. Data related to this communication session is transmitted over the assigned physical channels. Each message related to this communication session contains a CAT. IO,, through which this message can be properly -And directed and processed.

Fig.8 contains a diagram of the exchange of messages between the MS and the BS during the processing of the first information session of the communication received by the MS. General Paging Message, Paging Message-Response and RPPC-I are received and processed as shown in Fig.7. After receiving the RPPC, the MC switches to the substation of the informational 5r Channel. After receiving the PVOZ, the MS initiates a finite automaton of the CS of the appropriate SS Toure type and a finite automaton of the CS and is transferred to the conversation state. The MS also performs the service coordination procedure described above with the BS. o After completing this procedure, the MS receives the transmitted information from the BS in the designated physical channels.

Fig.9 contains a diagram of the exchange of messages between the MS and BS during the processing of the first voice communication session initiated by the MS. In the idle state 516, the MS receives a request from the user to establish a connection. The MS sends an Initiating Message, which includes, for example, a physical channel, a new type of 5O m service, a request for a certain type of finite state machine CS (SS Toure Ked), SA! IS, and dialed phone number. After that MS

F) receives the RPPC, which contains the assigned physical channel. As in Fig. 8, after receiving the RPPC, the MS goes into the substate of the information channel. After receiving the PVOZ, the MS initiates a finite state automaton CS of the specified SS Toure type and transfers this automaton to the conversation state. in Fig. 10 contains a diagram of the exchange of messages between the MS and the BS during the processing of the first information communication session initiated by the MS. This diagram is similar to the diagram of Fig. 9U, except that the MS initiates the finite state machine CS 540 after receiving the PVSZ. After the service negotiation is completed, the MS sends data on the assigned physical channels.

Fig. 11 contains a diagram of the exchange of messages between the MS and the BS for the subsequent (Y 21) voice session 65 communication received by the MS. The KMP sends a request to establish a connection and the BS in response sends a PVSZ, which includes, for example, SS Toure, SAT IB, and SOM. KERK. After receiving this message, the MS initiates the finite automaton KS 530 of the corresponding type (voice) SS Toure, which corresponds to SAIA |IO,. MS performs mapping between SAG and IO, and COM KERm.

To service a new voice communication session, the MS goes to substate 532 waiting for an order and can

Carry out the service coordination procedure. The MC adopts an air defense system that contains a new type of maintenance ZO. SOMOKERM and other parameters. After completion of service coordination, the MS accepts

Message-Requirement Service with ZKO, which contains assigned ZO M, COM KER and other parameters.

The subsequent communication session between the MS and the BS proceeds as described for Fig.7. Messages related to this and other voice communication sessions (except for the first) are identified by SAII IO, assigned to this session, 70 information communication sessions can use signal messages within the band.

Fig. 12 contains a diagram of the exchange of messages between the MS and the BS for the subsequent (Y 21) voice communication session initiated by the MO. In information channel substate 524, the user sends a call request. In response, the MS sends a PVSZ, which contains, for example, the required type of session control (SS Toure Ked) and is assigned to the SA Ibu session. Me, as the initiator of the communication session, can assign to a new session SAYI |O,. Next, 75 MS receives the PVSZ, which contains assigned SS Toure, SA IS, and SOM KER). After that, the MS initiates the finite automaton KS 530 of the corresponding (voice) type, which corresponds to SAIA |b,.Ms performs the mapping between SAGI I and SOM BERK.

To service a new voice communication session, the MS goes into the substate 536 of the conversation and sends an initiating Message, which includes, for example, IS KEYS, dialed phone number. After that, the MS performs the 2o service negotiation procedure, which in other embodiments may be performed before sending the initiating message. The messages of this procedure include a new service type of ЗО мк,шЕ and the corresponding parameters. Upon completion of the service agreement, the MS accepts the Notice of Joining

Maintenance (PPO), which includes ZKO with the assigned type of service 5O m, COM KER"x and the corresponding parameters. MS and BS can exchange Flash Information Messages as described for fFig.9. messages relating to this and other communication sessions are identified by designated CAs. Oh

Fig. 13 contains a diagram of the exchange of messages between the MS and the BS when the voice communication session i) (not the last) is released in the MS. In substate 536 of the conversation, the MS accepts a request from the user and moves to substate 538 of releasing the communication session, after which it sends a message about releasing the session, which contains the SAII |IO X of the session being released. In response, the MS receives a Message-Confirmation of the Release of the Communication Session, which contains the SAGI. IO The CS finite automaton of this session is also released.

If the release of the session eliminates the connection (it is determined through the display "session-type Me service") that defines the service, the procedures for negotiating the service are performed with the accompanying messaging about these connections. MS sends a Notice with a Requirement

Service with the ZKO, which includes includes SOM KER Mu, which must be released. After the completion of "service coordination, the MC accepts the PPO, which includes the KER COM", which must be released. uh-

Fig.14 contains a diagram of the exchange of messages between the MS and the BS upon release of the voice communication session (not the last one), initiated by the KMP. In the substate 536 of the conversation, the BS accepts the request to release the communication session, after which it sends the Communication Session Release Message to the MS, which contains the IO SAIs in the session being released. Having accepted this message, the MS goes to substate 538 of releasing the connection and sends "

Message-Confirmation of Communication Session Release, which contains the corresponding SAT! Oh. If the release of the session eliminates the service-defining connections, service negotiation procedures are performed with accompanying message exchanges for those connections. MS accepts;" Service Requirement message with ZKO, which includes SOM KER in which to be released. Upon completion of service coordination, the MC accepts the Service Notice, which includes

SOM KER, which should be released. If the physical channel is not needed for the next communication session, it is also released.

Fig. 15 contains a diagram of the exchange of messages between the MS and the BS when the MS releases the last voice communication session. In sub-state 536 of the conversation, the MS accepts a request from the user and goes to sub-state 538 - I release the communication session, after which it sends a Communication Session Release Message, which contains

CA I, the session being released. In response, the MS receives a Message-Confirmation of Release of Session and Communication, which contains CA IO. Since this communication session is the last one, the service-defining connection and the physical channels of this session may be released by exchanging appropriate CRC messages. The MC, in particular, sends a Release Order and receives a Release Order in response and returns to the state 518 of rest.

Fig.16 contains a diagram of the exchange of messages between the MS and the BS upon release of the last voice communication session initiated by the KMP. In substate 536 of the conversation, the BS accepts the request to release the communication session, after which

F) sends a Communication Session Release Message to the MC, which contains the SAI of the session that is being released. After receiving this message, the MS goes to substate 538 of releasing the connection and sends

Message-Confirmation of the Release of the Communication Session, which contains the corresponding CA IO. Since this communication session is the last one, the service-defining connection and the physical channels of this session can be released through the exchange of appropriate CRC messages (see Fig.15). The MS returns to a state of 518 rest.

Figures 7-16 contain diagrams illustrating various options for maintaining a communication session according to the invention.

The BS and MS elements described here may have different designs. The receiving and transmitting nodes can be made as one or more integrated circuits or in the form of discrete components, or as their 65 combination. The MC controller can be implemented as one or more integrated circuits, as a specialized integrated circuit (ABIS), as a digital signal processor (DSP), as a microprocessor, etc. and/or in the form of a set of programs that perform the described functions, other elements, as known to specialists , MS and BS can be implemented as technical means in combination with software.

The invention can find application in many existing wide spectrum communication systems and systems that

They are under development. Specific systems with PDKU are described in the already mentioned application 08/963386 and patents 4901307 and 5103459.

The above description of the preferred embodiments will allow any person skilled in the art to use the invention by making appropriate modifications and changes in accordance with the concepts and principles of the invention. The scope of the invention is not limited to the above embodiments and is defined by new principles and features.

Claims (40)

The formula of the invention 1. A method of simultaneous processing of one or more calls in a communication system with an extended spectrum of signals, which consists in receiving an indication of a certain call for processing at the station and implementing a finite automaton of call management in accordance with the type of a certain call, and the implemented finite the automaton is identified with a certain call and uses it to control the processing of this call. 2. The method according to claim 1, which differs in that a certain call is processed at a mobile station. 3. The method according to claim 1, which differs in that a certain call is processed at the base station. 4. The method according to claim 1, which differs in that they accept an indication of an additional call for processing at this station, and implement a finite state machine for controlling another call in accordance with the type of additional call. 5. The method according to claim 1, which is characterized by the fact that one of the possible connections for a certain call is determined, which contains information about a set of parameters applicable for forwarding data. 6. The method according to claim 5, which differs in that one of the possible connections for a certain call is determined by (o) one or more accepted messages. 7. The method according to claim 1, which is characterized by receiving messages about a physical channel for a certain call. about zo 8. The method according to claim 1, which is characterized by receiving a control command to cancel a certain call, canceling a certain call and canceling a finite automaton of controlling a certain call. (2) 9. The method according to claim 1, which is characterized by the fact that the realized finite state automaton of call management is selected of a type that corresponds to the type of a certain call. 10. The method according to claim 1, which differs in that a voice, information, video, IZOM or O5M call is processed as a certain call. what- 11. The method according to claim 1, which is characterized in that the implemented finite state automaton for voice call or information call has a dialogue intermediate state, which means a period of authorized transmissions for a voice call or information call, and a cancellation intermediate state, which means termination of the voice call or information call. "20 12. The method according to claim 11, which is characterized by the fact that the implemented finite state automaton for controlling a voice call with or an information call has an intermediate state of waiting for an order, which means waiting for a warning by an information message, and an intermediate state of waiting for a response, which means waiting for a response from the user on a voice call or an information call. 13. The method according to claim 1, which is characterized by the fact that service negotiation is carried out to determine one of the possible connections for a certain call. -AND 14. The method according to claim 1, which is characterized by the fact that the intermediate state of the traffic channel is maintained until at least one call remains to be processed. ve 15. The method according to claim 14, which differs in that, in the intermediate state of the traffic channel, a series of call management messages are exchanged to establish a new call. 16. The method according to claim 15, which is characterized by the fact that a series of service negotiation messages are exchanged for establishing one of the possible connections for a new call. lake 17. The method according to claim 16, which is characterized by the fact that the exchange of messages regarding call management is carried out independently of messages about service coordination. 18. The method according to claim 1, which differs in that a certain call is canceled at the mobile station. 19. The method according to claim 1, which differs in that a certain call is made at a mobile station. 20. The method of simultaneous support of one or more calls in a communication system with an extended spectrum (F) of signals, which consists in accepting an indication of the first call for processing, determining the first GI of possible connections for use in data transmission, establish multiple physical channels for matching with the first alternative connection, map the first call to the first of the possible connections, and implement a call control finite state machine in accordance with the type of the first call to control the processing of this call. 21. The method according to claim 20, which is characterized by the fact that a separate finite state machine is implemented for controlling each subsequent call to be processed, and the implemented finite state machine is of a type corresponding to the type of the next call. 65 22. The method according to claim 21, characterized in that additional one or more of the possible alternative connections applicable for data transmission are defined and each active call is mapped to one of the defined connections. 23. The method according to claim 20, which is characterized in that receiving a control command to cancel a certain call, canceling a certain call and canceling a finite automaton for controlling a certain call. 24. The method according to claim 23, which is characterized in that it is determined whether a certain connection that is mapped to a certain call is also mapped to at least one active call and cancels the certain connection if it is not mapped to any active call. 25. The method according to claim 24, characterized in that it is determined whether each of the one or more physical channels that are combined with the canceled connection is combined with at least one active connection, and cancel the 7/0 physical channels that are not combined with at least one active connection. 26. A method of processing one or more calls in a spread spectrum communication system, which consists in selecting a certain communication system to use, monitoring the paging channel for an incoming call warning message, establishing one or more physical channels to transfer data for one or more calls, implement a finite state automaton of call control, which is of the same type as the type of each one or more calls, exchange messages for one or more calls over one or more established physical channels, accept the management command to cancel a certain call and cancel the finite state machine of control of a certain call in response to the received management command to cancel the call. 27. The method according to claim 26, which is characterized by the fact that the implemented finite state machine for controlling a voice call or an information call has a dialogue-intermediate state, which means a period of authorized transmissions for a voice call or an information call, and an intermediate state of cancellation, which means the termination of a voice call or information call. 28. The method according to claim 27, which is characterized by the fact that the implemented finite automaton for controlling a voice call or an information call has an intermediate state of waiting for an order, which means waiting for a warning with an information message about the processing of a voice call or an information call, and an intermediate state of waiting for a response, which means waiting for the user's response to a voice call or an information call. and) 29. The method according to claim 26, characterized in that one or more calls are identified by a unique name. 30. The method according to claim 26, which differs in that each of the messaging messages is marked with the call identifier to which the message belongs. about zo 31. A mobile spread-spectrum communication system device having a receiver for receiving incoming messages, a transmitter for transmitting outgoing messages, and a controller operatively connected to the Me) receiver and transmitter for receiving an indication of a certain call for processing and implementing a finite M of the call control automaton in accordance with the type of a certain call, and the realized finite automaton is identified with a certain call and is used to control the processing of this call. - 32. The device according to claim 31, which differs in that the controller is additionally designed to receive an indication of an additional call for processing and implement a finite state machine for controlling another call in accordance with the type of additional call. 33. The device according to claim 31, which is characterized by the fact that the controller is additionally designed to receive a control command to cancel a certain call and to cancel the finite automaton controlling this call. " 34. A mobile device of a wide-spectrum communication system that has a receiver for receiving incoming messages, a transmitter for transmitting outgoing messages, and a controller that is functionally connected to the receiver and transmitter to implement a finite state call processing machine having a state ;" initialization, which means a period of synchronization with a specific spread spectrum communication system, an idle state, which means a period of ongoing paging channel control, a system access state, which means a period of access to a base station, and a traffic state, which means processing at least one - And active calls, among which each active call is combined with a finite automaton of call management. 35. The device according to claim 34, which is characterized in that the traffic state has an intermediate state of initialization of the traffic channel, which means the transmission of data on the traffic channels, an intermediate state of the traffic channel, which means - AND the transmission of data in relation to a certain call, and an intermediate state of cancellation, which means the completion of a particular Challenge. ik 36. The device according to claim 34, which is characterized in that the controller is further designed to implement a finite state automaton for each processed call, and the finite state automaton of the call is of a certain type, which is selected according to the type of call being processed. 37. The device according to item Zb, which differs in that the implemented finite state automaton for controlling a speech call or an information call has an intermediate state of waiting for an order, which means waiting for a warning by an information message about the processing of a speech call or an information call, (F) an intermediate state of waiting for a response , which means waiting for the user's response to a voice call or an information call, a dialogue intermediate state, which means a period of authorized transmissions for a voice call or an information call, and a call cancellation intermediate state, which means the termination of a voice Call or an information call. 38. A base station of a spread-spectrum communication system having a receiver for receiving incoming messages, a transmitter for transmitting outgoing messages, and a controller operatively connected to the receiver and transmitter for receiving an indication of a particular call for processing and implementing a finite state control machine a call in accordance with the type of a certain call, and the implemented finite avgomat 65 value is identified with a certain call and uses it to control the processing of this call. 39. The base station according to claim 38, which is characterized by the fact that the controller is additionally designed to receive an indication of an additional call to process and implement a finite state machine for controlling another call in accordance with the type of additional call. 40. The base station according to claim 39, which is characterized by the fact that the controller is additionally designed for receiving the Management command to cancel a certain call and canceling the finite automaton controlling this call. with more 6) "c) then F cha " m. - with . and? -I sh» -I se) (42) ime) 60 b5