A METHOD OF EFFECTING RANDOM ACCESS IN A MOBILE RADIO SYSTEM

Abstract: A method for random access in a time divided mobile radio system, for instance an FDMA/TDMA system, which includes digital traffic channels and control channels which are organized so that four traffic channels (TC) and two control channels (CC) are included in a TDMA-frame. A base station (BS) transmits continuously flags (B/I, R/N, R/F) in the time slots (1, 4) of the control channels. A mobile station desiring access to the system responds by sending a first message word (W1) in the time slot indicated by the base station in a first flag (B/I). When the mobile station (MS1) wishes to transmit several message words (W2, W3), the base station (BS) reserves one or more time slots to this end by transmitting the first flag (B/I), although this flag now states that these time slots are busy for other mobile stations (MS2, MS3). Furthermore, the base station transmits a flag (R/N) which states whether or not a message word has been received from the mobile station (MS1). The base station can transmit a further flag (R/F), which denotes that a given time slot has been reserved for a given mobile station (MS3) from the very beginning of an access procedure and cannot therefore be used by any other mobile station (MS1, MS2).

Description: A METHOD OF EFFECTING RANDOM ACCESS IN A MOBILE RADIO SYSTEM TECHNICAL FIELD The present invention relates to a method of effecting rando access in a time divided mobile radio system having a primar station and a plurality of secondary stations belonging to th primary station. More specifically, the invention relates to method of access to these secondary stations when they are in a idle mode, i.e. when the stations listen to messages from the primary station within a given geographical area (cell) and whe they wish to establish some form of communication with the primary station. The mobile radio system is a time divided system (TDMA or CDMA) or a combined frequency and time divided system (FDMA/TDMA) with so-called digital control channels, which are utilized by the inventive method. BACKGROUND ART Random access in a mobile radio system, for instance a mobile telephone system, is known both for analog and digital systems. Random access implies generally that a secondary station (mobile station) transmits to a primary station randomly in time an initial message in accordance with a given protocol, requesting access to the primary station. The primary station then responds, by sending a flag to the secondary station for continued com¬ munication between the primary and the secondary stations. The access protocol used in TDMA-systems, so-called time divided or slotted Aloha, is described, for instance, in EP-A-0,321,454. An access method with time divided Aloha is described, for instance, in the U.S. patent 5,166,929 (Wing Lo) . According to this known method, access is effected by a mobile station by sending to a base station reservation messages which denote which time slot and how many such time slots shall be reserved by the base station for the mobile station concerned, in order to enable the mobile station to complete its access message, so called "Reservation Aloa". This known method can be used particularly in a digital control channel and the access messages can be sent in those free spaces that are created in such a channel when certain control information (SACCH, DVCC) normally used in a traffic chan- nel is not used. SUMMARY OF THE INVENTION The known access method according to the aforesaid U.S. patent deals with the problem of how a mobile station can communicate with a base station by requesting for certain time slots and a certain number of time slots to be reserved for the continued access message. In this regard, the base station uses a flag marked "reserved" and "idle", respectively, where "reserved" thus marks in the base station those time slots of the continuously transmitted time slots that have been reserved for a certain mobile or for several mobiles desiring access to the system. It is assumed that the continuedcommunication is effectedwithoutundue hinder to or error in the messages transmitted to the base station. The present method is also based on the known access method for continued communication after having reserved time slots for a mobile station. According to one embodiment of the proposed method, a further flag is inserted in the base station, "recei¬ ved", "not received", abbreviated to R/N, which discloses whether or not the message word transmitted to the base station from the mobile station within a given time slot has actually be received by the base station. If the message word has not been received, the base station asks the mobile to transmit solely the latest word. When the word concerned was one of the last words in the message, a significant simplification is achieved in comparison with the case when it is necessary to transmit the whole message again, as is normal when errors in transmission occur. According to a further embodiment of the invention, there is introduced a third flag which is additional to the aforesaid two flags. This third flag, "reserved, free", R/F, is sent from the base station, as with other flags, and discloses to the mobile the time slot in which the mobile shall transmit a response to the request transmitted from the base station and in which the information concerning the reserved time slot was found. One object of the present invention is to provide a method of achieving random access in a time divided (TDMA) mobile radio system which will ensure that, even after the secondary station desiring access to the primary station has been allotted one or more message time slots, a message will be completely transmitted to a base station without unnecessary repetition of message words that have been correctly received. Another object of the present invention is to allocate, upon access to a mobile radio system, a free time slot to a mobile station from a base station in conjunction with transmitting access messages which require simple confirmation from the mobile station in the form of a message word. A further object of the present invention is to establish three different flags in a base station which receives messages from mobile stations for access to the base station, of which flags two are used to allocate more than one time slot for the message from the mobile station and to ensure that this message is received correctly in the base station, and one is used to reserve before¬ hand one time slot for an access message from a given mobile station. The inventive method is characterized by the features set forth in the independent Claim 1. Other embodiments of the inventivemethod are characterized by the features set forth in the independent Claims 5, 7 and 8. BRIEF DESCRIPTION OF THE DRAWINGS The invention will now be described in more detail with reference to the accompanying drawings, in which Figure 1 illustrates schematically a primary station and three secondary stations of a mobile radio system; Figure 2 illustrates a time slot format for an uplink digital control channel in a time divided (TDMA) mobile radio system; Figure 3 illustrates a time slot format for a downlink digital control channel in a time divided (TDMA) mobile radio system; Figure 4 illustrates a message sent from a secondary station according to Figure 1 and divided into message words; Figure 5 is a diagram which illustrates the inventive method in respect of a message according to Figure 4; Figure 6 is a decoding diagram which illustrates flags used in accordance with the inventive method; Figure 7 is a flow chart illustrating two examples of the inven¬ tive method; Figure 8 is a flow chart illustrating a third example of the inventive method; and Figure 9 is a block diagram illustrating that part of a mobile station which evaluates the flags illustrated in Figure 6. BEST MODES OF CARRYING OUT THE INVENTION Figure 1 illustrates generally a primary station and a number of secondary stations in a mobile radio system, which may be an analog or a digital system and possibly also a cellular system. The primary station is a base station BS and the secondary stations are mobile stations MSI, MS2, MS3. The inventive method is intended for application in a time divided mobile radio system, preferably a cellular system which includes so-called digital control channels. In present-day North American systems, control channels are analog channels, i.e. check and control messages are transmitted over analog channels, even when the traffic channels are digital. In future systems, however, such messages, for instance authentication checks, will also be transmitted over digital control channels. In the simplified digital system with digital control channels shown in Figure 1, it is assumed that each of the mobiles MS1-MS3 is in its idle mode. The base station BS continuously transmits messages with so-called flags in the forward direction over a control channel DFOCC, although in given time slots, these flags indicating whether the time slot in which the message is sent is idle or busy. A mobile station MSI is able to receive such messages in certain time slots and transmits back to the base station in another control channel DRECC in the reverse direction, so that the message can be received by the base station BS. This enables the mobile stations to obtain random access to the system. The time slot format shown in Figures 2 and 3 has been proposed, with the intention of creating the two control channels DFOCC and DRECC in the forward and reverse direction respectively. Compared with the digital traffic channel as proposed in the North American Standard EIA/TIA IS-54B, April 1992 (page 9, 1,2 "Digital Traffic Channel Structure") , the reverse control channel DRECC has a reserved space RES and the forward control channel DFOCC has a divided reserved space RES1., RES2. The spaces are used for the information bits which are included in those flags that are transmitted from the base station in respective control channels, as described in more detail below. Messages (without flags) are transmitted from a mobile station in the data fields Data D. Figure 4 illustrates a message word M, for instance a message from a mobile station MSI to the base station BS concerning a reply to an authorization query from the base station BS. The message is divided into a number of words, in the present example five words Wl, W2, ... W5, each of which is intended to be sent as a burst within a given time slot. The message need not be a "straight" message, in the meaning that the information is transmitted as a continuous message in time, but may be interleaved with several message words or with several messages. This procedure is known per se and has no decisive significance to the principle of th present invention. The division of a message according to Figur 4 is called segmentation and each message word W1-W5 is channel coded in a known manner and formatted so as to enable it to b transmitted as a burst in a time slot. Figure 5 is a diagram which illustrates transmission over the tw channels DFOCC and DRECC in relation to the two time slots withi each frame that the control channels have at their disposal. As is known, a TDMA-frame in the North American mobile radi system is comprised of six time slots, of which the time slots and 4 are reserved for the control channels and the remaining fou time slots are reserved for the traffic channels. The time slots of the control channels are the time slots shown in Figure 5 and referenced 1 and 4. Not all of the time slots of all traffic channels have been shown in Figure 5. The upper row of time slots are those which are at the disposal of flags and message words that shall be received by a mobile station MS1-MS3, while the bottom row of time slots are those in which a mobile station transmits message words to the base station. The base station initially transmits the messages continuously in the control channel time slots (1 and 4) . A mobile station MSI which desires access to the system can seize a message word from the base station BS, which therewith informs that the mobile station can transmit back to the base station in a given free time slot. In the "Aloha Reservation" method, the mobile station MSI responds by asking the base station to reserve a given number of time slots, so that the message from the mobile can be received by the base station. In response, the base station sends a flag B/I("busy/idle") , which indicates that the time slots requested by a given mobile have now been reserved for said mobile MSI and are thus busy to other mobiles MS2, MS3. This applies in those instances when a message has several words and several time slots are therewith required to transmit the message. It is obvious that this method is not sufficiently reliable t ensure that a message can be transmitted to the base station wit certainty. For instance, the base station must be able to es¬ tablish that the message word has been transmitted correctly, an if this is not the case to ask for the word to be retransmitted. Consequently, according to the presentmethod, the number of flags sent by the base station BS is extended in accordance with the following: One flag R/N ("received/not received") , where "R" denotes that the message word is considered to have been received correctly, for instance by carrying out a so-called CRC ("cyclic redundancy check") on the word received, and where "N" thus denotes that the base station does not consider the word to have been received correctly, and a flag R/F ("reserved/free") , where R denotes that a time slot in DRECC, i.e. for transmission by the mobile to the base station is reserved by the base station for this particular mobile, so that the mobile can sent its reply to the base station. Normally, the message in DFOCC from the base station will include a request for the mobile to transmit, e.g., an acknowledgement, and the messagewill therefore contain information relating to the time slot that has been reserved for this particular mobile. For instance, the DFOCC-message ' will contain information as to how many time slots the mobile can expect from a given reference time- point to the reserved time slot. "F" indicates that no time slot has been reserved for the mobile and that the time slot which, e.g. , should have been reserved for the mobile MSI is instead now free for other mobiles MS2, MS3. The two additional flags need not be used simultaneously. The flags R/N and R/F are independent of one another and in some instances it is sufficient to use only the flags B/I and R/N. All flags are set in the base station from the beginning, when no message exchange has yet taken place. B/I is set to I ("idling") ; R/N is set to N ("not received") ; and R/F is set to F ("free") . ? The inventive method will now be illustrated with reference t three examples, see Figure 5. A common feature of the followin examples A and B is that the base station BS sends the flags I, N, F to all mobile stations MS1-MS3 and that these flags are receive by the mobile stations MSI, MS2 in accordance with examples A an B respectively. Thus, it is assumed in the first example A that the mobile MSI ha captured the flags I, N, F and seeks access to the system throug one single message word Wl, which shall be sent by MSI to th system via the base station BS, in the time slot 1, frame 1, allotted by the base station. The mobile station MSI transmits (arrow 2A) and the base station BS detects the sync, word (SYNC, Figure 2) in DRECC, decodes the message word and carries out a CRC- check. No flags in the time slots are changed if CRC found the received message word to be incorrect, i.e. the flags are main¬ tained as I, N and F, as shown in Figure 5. If CRC found the received message word to be correct, which is the case according to this example, the receiving flag is set to R. In this case, the message is comprised of only-one message word to the base station BS, which sends the flags I, R, F back to the mobile station MSI (arrow 3A) . This station receives the flags I, R, F and therewith observes that the message word Wl, i.e. the whole of the message in this particular case, has been received correctly by the system and that access has thus been successful. In the other example B, it is assumed that the mobile station MS2 seeks access to the system (the base station BS) , the access message M consisting of two message words Wl and W2 which are received correctly by the base station BS. No particular time slot has yet been reserved for MS 2 and the base station BS sends the flags I, N, F to all mobile stations, although it is assumed that time slot 1 in frame 2 is picked-up by MS2 (arrow IB) . When the mobile station MS2 sends its first message word Wl (arrow 2B) , it indicates to the base station BS at the same time that it intends to transmit two message words Wl, W2. Consequently, the base station BS indicates in its message (arrow 3B) that the time slot 1 in frame 5 has been marked as busy "B". This word is received correctly by the base station BS, which sends the flags "B" and "R" over DFOCC, which are received by MS2 (arrow 3B) . The mobile station MS2 now sends the other message word W2 over DRECC (arrow 4B) , and this word is also received correctly by the base station BS. Consequently, the base station BS transmits the flags "I" and "R" (arrow 5B) , where "I" thus indicates that the next time slot (time slot 1, frame 8) which should have been busy "B" is now free to other mobile stations MSI, MS3, since no further message words are expected from the mobile station MS2. in the two examples A and B described above, the different mobiles compete between themselves to obtain a free time slot when the base station BS transmits its flags I, N, F (arrows 1A, IB) , so as to be able to send the first message word to the base station BS. The first to do this is the winner. However, the system (the base station) is able to allocate a reserved time slot to a givenmobile MS3 prior to transmitting the flags, so that this mobile does not need to compete with the other mobiles MSI, MS2. In this regard, the base station transmits the flags I, N, R, where "R" thus denotes that a time slot in a given frame has been reserved and is therefore unaccessible to other mobile stations, in this example the mobile stations MSI, MS2. It is assumed in the third example C that the mobile MS3 begins to transmit a message M in a time slot that has already been reserved, this message consisting of two message words Wl and W2. It is assumed that one of these message words is received wrongly by the base station, due to the word being distorted (because of fading, for instance) during transmission. It is also assumed that the system has earlier reserved a time slot for the mobile station MS3. This time slot may have been reserved in conjunction with an earlier access to the mobile station MS3, according to example A above. The last message from the base station BS (arrow 3A) contained information relating to the position of the reserved time slot, calculated in number (22) of half-frames, each of 20 ms from, for instance, the time-point of the first message (arrow 2A) from the mobile MS3. The base station will transmit its response with the flags I, N, R (arrow 1C) in accordance with the aforegoing, and the mobile MS3 will transmit its first message word Wl (arrow 2C) upon receiving the flags. The base station BS receives and checks whether or not more message words are to be transmitted. Since this is the case, the flags B, N, F are sent to the mobile MS3. However, the base station BS has not detected the message word Wl correctly, and hence the base station sends "B" and "N", where "N" denotes that the message word last received has not been received correctly and should therefore be sent again. The base station therefore sends (arrow 3C) the aforesaid flags "B" and "N" and also asks MS3 to transmit the latest message wordWl again. The mobile MS3 receives this message and notes that the word Wl shall be transmitted again, and complies with this request, arrow 4C. It is assumed that retransmission of the word is successful and that BS receives the word Wl correctly. The different procedures undertaken in a mobile station in conjunction with the aforedescribed exchange of messages will be described in more detail with reference to the flow charts illustrated in Figures 7 and 8. However, the Carnaugh diagram shown in these Figures will be explained in more detail first, see Figure 6. In the Carnaugh diagram of Figure 6, all flag combinations from the first, second and third rows have been combined in four columns, so that the first column states the case IN "idle" and "not received"; the second column states the case IR "idle" and "received"; the third column states the case BR "busy" and "re¬ ceived"; and the fourth column states the case BN "busy" and "not received" for the two possibilities F "free" and R "reserved" of the third flag. The Carnaugh diagram shown in Figure 6 discloses how a state given by the burst in a given time slot 1 or 4 according to Figure 5 shall be interpreted by a mobile station MS1-MS3 when this station receives the burst in the time slot from the base station in the forward control channel DFOCC. Four possible outcomes are found in the Carnaugh diagram, illustrated by the references 1-4. For one of these outcomes, certain conditions shall be fulfilled as indicated by the rectangular blocks in the diagram. The outcome 1 applies to the two flags: That the received word denotes that the time slot is idle and that the word from a mobile station has not been received correctly and that the time slot is either free or reserved. The outcome 2 applies to four cases: That the time slot is idle at the same time as words have been received for the two possi¬ bilities free or reserved time slot, or the time slot is occupied for the same two possibilities. The outcome 3 applies to only one case: That the time slot is busy and the message word has not been received correctly at the same time as the time slot is reserved. The outcome 4 also applies to only one case, similar to outcome 3, although in this case the time slot is free. There is included a Carnaugh diagram in each of the flow charts shown in Figures 7 and 8, so that the various steps carried out in a mobile station can be explained. Each Carnaugh diagram shows the state and those outcomes that are obtained on a given occasion (instant) , depending onwhich flaghas been received from the base station and corresponding to the various arrows 1A, 2A, ... ; IB, 2B, ... , according to Figure 5. Figure 7 is a mobile station flow chart which is intended to illustrate the two aforesaid examples A and B. The decoding diagram 1 in Figures 7 and 8 gives a certain outcome which will depend on the flags of the first message from the base station BS, while the diagrams 5 and 6 will give certain outcomes which will depend on the flags of the second and subsequent messages. According to example A, mobile station MSI wishes to send a simple message to the base station BS. The incoming first message including the flags I, N, F is decoded in accordance with diagram 1 and gives the outcome 1 (Figure 7) . The mobile station therefore brings forward the first message word Wl (in this case, the only word to be sent) according to block 2 (Figure 7) , and transmits this word, block 3. Subsequent to having transmitted the word Wl, a query is raised, block 4, as to whether more than one word shall be transmitted. Since this is not the case, the answer "No" is obtained from block 4. The base station BS has sent the message including the flags I, R, F to MSI and has received the first word Wl (arrow 3A, Figure 5) , whereby the diagram 5 for the second mes¬ sage sends the outcome to block 9, disclosing that the transmis¬ sion was "successful". In the case of the other example B, the message is comprised of two words Wl, W2 from the mobile station MS2, it being assumed that these two words have been received correctly by the base station BS. The mobile station MS2 receives the flags I, N, F from the base station BS (arrow IB, Figure 5) , similar to example A, and brings forward the first message word Wl in accordance with block 2, pointed out by the outcome from diagram 1. A check is then made to ascertain whether or not more words shall be transmitted, block 3 and 4. Since this is the case, the answer "Yes" is obtained, which means that the diagram 6 shall apply to the flags in the next message incoming from the base station BS. Since the message includes the flags B, R, F (arrow 3B) , an outcome indicating block 7 is obtained, this block stating that the next word can be brought forward in the mobile station MS2. According to the loop, the next step is a return to block 3 and the second word W2 is transmitted to the base station BS (arrow 4B, Figure 5) . Since no more words are to be transmitted according to question block 4, the next message from the base station BS (arrow 5B) is decoded in accor¬ dance with diagram 5. This message includes the flags I, R, F and the transmission is therefore considered tobe "successful", block 9. Figure 8 is a flow chart for the example C, i.e. in which a time slot has been reserved in advance for the mobile station MS3 and the base station shall thus send the flags I, N, R (arrow 1C, Figure 5) . If the correct flags I, N, R are sent, an outcome is obtained indicating block 2 and the mobile station will bring forward the first message word Wl. If the continued communication shows that the base station receives correctly, the steps are executed in the same way as that described with reference to examples A and B. On the other hand, if the base station BS has not understood or correctly received the transmitted word Wl (arrow 2C) , the base station will send the flags B, N, F (arrow 3C) , where "N" denotes incorrect reception, as described above. On this occasion, it is the diagram 5 that determines which outcome shall be given, and this outcome points to block 8 which means that the same word, i.e. Wl, shall be fed back to block 3, i.e. the word Wl shall be retransmitted. On the next occasion, when a message from the base station arrives (arrow 5C) , it is the diagram 6 which determines what outcome is given. If, as in the present case, a further word W2 is to be sent and the flags I, R, F arrive, the diagram 6 indicates an outcome to block 7 to be given and that the further word W2 is transmitted. If this word is received correctly by the base station, the flags I, R, F are sent, since the word W2 was the last word. If the word W2 had not been the last word and a further word W3 should have been sent from the mobile stationMS3, the base station would have sent B, R, F and the steps according to example B would have been carried out. The different flags are transmitted as binary values in a known manner from the base station to respective mobile stations in the forward control channel DFOCC according to Figure 3, and in the spaces RES1, RES2 and possibly also in the space RES. The micro¬ processor of the mobile station includes a register for storing and evaluating the incoming binary values of each of the flags. These registers are illustrated schematically in Figure 9 and are designated REG1, REG2, REG3 for the respective three flags R/N, R/F and B/I. Thus, in the present example, each of the three flags is represented by a three-bit word and the binary value of this word decides how the flag is interpreted. Evaluation units VI, V2, V3 are each connected to a respective register and evaluate the incoming binary value of respective flags in an appropriate manner (see below), i.e. determine which of the two values in a flag is applicable. Conveniently, there is found a set of registers REG1-REG3 and associated evaluation units V1-V3 for each of the decoding diagrams 1, 5 and 6 according to Figures 7 and 8. In its simplest form, each of the evaluation units VI-V3 is a simple comparator and deals with respective flags, by prescribing that the first four binary values 000, 001, 010, 011 constitute the "R", "R" and "B" flags respectively, while the four remaining binary values 100, 101, 110, 111 constitute the "N", "F" and "I" flags. The flag B/I is particularly sensitive to a wrong interpre¬ tation, i.e. if the flag is interpreted as "I" when "B" is meant to be sent, or vice versa. It is therefore convenient, in accor- dance with the following, to allow the first seven binary values 000, ... , 110 to represent "B" and solely one binary value 111 to represent "I". Naturally, it is possible to insert a similar distribution of the binary values in the registers for the flags R/N and R/F. Thus, variable thresholds can be introduced when evaluating the different flags. In the case of the decoding diagram 1 shown in Figures 7 and 8, which applies to the flags of the first message from the base station BS, the register REG3 for the B/I flag is constructed so that "B" will be given priority, since the wrong interpretation "I" instead of "B" would mean that the mobile station in the process of a message transmission (access) would be interrupted by an access attempt from another mobile station. From the aspect of hardware, this means that the first seven values 000, ..., 110 should be allowed to represent "B" and the value 111 should be allowed to represent "I", in accordance with the aforegoing. In the case of diagrams 5 and 6, which apply to the steady-state progress, the B/I flag need not be afforded any particular priority. This means that the threshold is placed in the centre, i.e. as many binary values are reserved for "B" as those reserved for "I". With regard to diagram 1, the same priority applies to flag R/F as that which applies to the flag B/I. No special priority is required for the flag R/N in the diagram 1. The flags R/F and R/N need no special priority in respect of the diagrams 5 and 6.

Claims: CLAIMS 1. A method of achieving random access in a time divided (TDMA) mobile radio system, in which control channels and traffic channels are formed by time slots within a frame, and which includes at least one primary station (BS) and a number of secondary stations (MSI, MS2, MS3) , each of which intends to send access messages in the form of short message words (Wl, W2, ...) , each during a time slot allocated by the primary station (BS) by virtue of the primary station sending continuously a first flag (B/I) which denotes a state whether or not a time slot during which a secondary station shall transmit a message word to the primary station (BS) is idle (I) or busy (B) , so that one (MSI) of the secondary stations, in response to the state transmitted from the primary station, can send a first (Wl) of said message words in the time slot indicated by the first flag as idle (I) , or a second word (W2) , a third word (W3) , and so on, in those time slots that the first flag has indicated as busy (B) , characte r i z ed in that the primary station sends simultaneouslywith said first flag (B/N) a second flag (R/N) which indicates to the transmitting secondary station (MSI) whether or not the primary station (BS) has received said message word; and in that the primary station requests retransmission of the message word (Wl) that has not been received. 2. A method according to Claim 1, c h a r a c t e r i z e d in that, after having received saidmessageword, the primary station again transmits the first flag (B/I) which denotes that said time slot is continuously allocated the secondary station (MS2) if this station intends to transmit more message words (W2, W3, ...) , and at the same time transmits the second flag (R/N) which ack- nowledges whether or not the first message word (Wl) has been received by the primary station (BS) . 3. A method according to Claim 2, c h a r a c t e r i z e d in that when the primary station has not received the first message word (Wl) , the second flag (R/N) includes a request for the first message word to be retransmitted by the secondary station (MS) in the time slot allocated by the primary station according to the first flag (B/I) . 4. A method according to Claim 1, c h a r a c t e r i z e d in that the primary station, in addition to said first and second flags (B/I, R/N) , transmits continuously and together with said flags, a third flag (R/F) to all secondary stations (MS1-MS3) , indicating that a given time slot is reserved for a given secon¬ dary station (MS3) for the purpose of transmitting a first message word (Wl) from this secondary station (MS3) . 5. A method of detecting a flag in conjunction with random access in a time divided (TDMA) mobile radio system, in which control channels and traffic channels are formed by time slots within a frame and which comprises at least one primary station (BS) and a number of secondary stations (MSI, MS2, MS3) , each of which intends to transmit access messages in the form of short message words (Wl, W2, ...) each during a time slot allocated by the primary station (BS) by continuously transmitting said flag (B/I) which indicates whether a time slot during which a secondary station shall transmit a message word to the primary station (BS) is idle (I) or busy (B) , so that one (MSI) of the secondary stations is able to transmit in response to the state transmitted by the primary station, a first (Wl) of said message words in the time slot indicated by the flag as idle (I) , and can also transmit a second word (W2) , a third word (W3) , and so on, in those time slots that are indicated as busy (B) by said flag, c h a r a c¬ t e r i z e d in that when detecting the flag in the secondary station (MSI), a first number of binary values (000, — 011) is assigned to one state (B) of a flag (B/I) and a second number of binary values (100, ... Ill) is assigned to another state (I) of said flag, wherein the first number of binary values is greater than the second number of binary values when the one state (B) shall be given priority over the other state (I) . 6. A method according to Claim 5, c h a r a c t e r i z e d i that said priority is given in conjunction with detecting the fla (B/I) of the first message (arrow 1A, Figure 5) from said primar station (BS) to a given secondary station (MSI) which after having sent one message word (Wl) intends to send a further message word (W2). 7. A method of detecting a flag in conjunction with random access in a time divided (TDMA) mobile radio system, in which control channels and traffic channels are formed by time slots within a frame and which includes at least one primary station (BS) and a number of secondary stations (MSI, MS2, MS3) , each of which intends to send access messages in the form of short message words (Wl, W2, ...), each within a time slot that is allocated by the primary station (BS) by said station continuously transmitting said flag (R/N) , which denotes whether a message word (Wl) transmitted in a given time slot from a secondary station has been received (R) or has not been received (N) by the primary station (BS) , so that the secondary station can continue or terminate transmission of message words, c h a r a c t e r i z e d in that upon detection of the flag in the secondary station (MSI) , there is allocated a first number of binary values (000, ... 011) to one state (R) of the flag (R/N) and a second number of binary values (000, ... Ill) is allocated to another state (N) of the flag, wherein the first number of binary values is equal to the second number of binary values. 8. A method of detecting a flag in conjunction with random access in a time divided (TDMA) mobile radio system, in which control channels and traffic channels are formed by time slots within a frame, and which includes at least one primary station (BS) and a number of secondary stations (MSI, MS2, MS3) of which each intends to transmit access messages in the form of short message words (Wl, W2, ...) , each within a time slot which is allocated by the primary station (BS) by said primary station continuously transmitting said flag (R/F) which denotes whether a time slot during which a secondary station shall transmit a message word to the primary station (BS) has earlier been reserved (R) or is free (F) , so that one (MS3) of the secondary stations in response to the state transmitted from the primary station can send said message word in the time slot that the primary station has previously given as reserved (R) , c h a r a c t e r i z e d in that upon detection of the flag in the secondary station (MSI) , there is allocated a first number of binary values (000, ... 011) to one state (R) of the flag (R/F) and a second number of binary values (100, ... Ill) is allocated to another state (F) of the flag, wherein the first number of binary values is greater than the second number of binaryvalues when one state (R) of the flag shall be given priority over the second state (F) of said flag.

Inventors: DAHLIN JAN ERIK AAKE ST, MUELLER WALTER GERHARD ALOIS, DAHLIN, JAN, ERIK, ANGSTROM KE, STEINAR, MUELLER, WALTER, GERHARD, ALOIS
Applicants: ERICSSON TELEFON AB L M, TELEFONAKTIEBOLAGET LM ERICSSON
Application year: 1993
Main classification: H04B7
IPC codes: H04B7, H04W74