Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network
Patent
1997-01-06
1999-07-06
Zimmerman, Brian
Multiplex communications
Data flow congestion prevention or control
Control of data admission to the network
370345, 370347, 370349, 370229, 370235, 370236, 375233, 371 32, 371 33, 39520056, H04L 100, H04J 600
Patent
active
059205458
DESCRIPTION:
BRIEF SUMMARY
FIELD OF THE INVENTION
The present invention relates to non-transparent data transmission in a digital telecommunications system, in particular in a radio interface of a mobile communications system.
BACKGROUND OF THE INVENTION
The problem in transmission over transmission channels that are sensitive to interference, such as the radio path, is often the poor quality of the transmission. Although several standardized end-to-end data services are actually provided with error correction protocols, which are applied either to the entire end-to-end connection or to some segments of the transmission path, these protocols are designed for error situations that are typical of fixed lines, but they are inadequate or unsuitable for special conditions, such as to a radio link. Therefore, it has been necessary to implement dedicated error correction solutions within the mobile communications system.
Since no single solution is suitable for all data services, there are several types of connections available e.g. in the pan-European mobile communications system GSM, and these connections may be divided into two classes. In the first class, error correction is carried out solely by means of channel coding, which in the GSM system is termed as Forward Error Correction (FEC). In the GSM recommendation this is termed as a transparent transfer mode, which is also abbreviated with "T". In the second connection class, in addition to channel coding, an additional protocol is applied, with re-transmission of data which has not been received correctly at the other end. In the GSM system this communication protocol is termed as a Radio Link Protocol (RLP), and this data transfer mode is referred to as non-transparent asynchronous data transmission, which is also abbreviated with NT. The present invention relates to the non-transparent data transmission.
In the non-transparent asynchronic data transmission over a circuit switched connection, data is transmitted from a transmitting party A to a receiving party B in RLP frames. The RLP frames are channel coded for the duration of transmission, so that the errors caused by the transmission channel can be corrected by the receiving party B in a channel decoding. In addition to the actual user data, RLP frames also contain error correction bits, by means of which the receiving party B can detect the errors that have not been corrected by channel coding. Each RLP frame is also numbered, or the order of the frames is indicated by another kind of identifier. The correctness of each received frame is tested at the receiving end. If the frame is detected to be correct, the receiving party acknowledges the reception by using the frame number. If the frame is not detected to be correct, a negative acknowledgement is transmitted. When the transmitting end receives a negative acknowledgement, or no acknowledgement at all, the transmitting party A re-transmits the RLP frame a predetermined number of times. The total number of the re-transmissions is limited in order to avoid endless transmission loops in a case of a very poor connection.
The RLP frames are stored, i.e. "buffered" at the transmitting end until they have been acknowledged, so that they are available if re-transmission is required. In order to limit the amount of buffering required, a sliding window is employed in the RLP protocol. Thus, the transmitting party A may transmit several RLP frames before an acknowledgement is required from the receiving party B. Since the errors passing through the channel coding are corrected by means of re-transmission of the defective RLP frames, "surplus capacity" must be reserved for re-transmission. This means that the data rate of the non-transparent connection is higher than the nominal data rate of the user. In a case where a channel has a relatively high quality, that is, when there are few errors passing the channel coding, this surplus capacity allows a sufficient number of re-transmissions without the actual data rate of the connection falling below the nominal user data rate. When the
REFERENCES:
patent: 4334306 (1982-06-01), Ulug
patent: 4691314 (1987-09-01), Bergins et al.
patent: 4888767 (1989-12-01), Furuya et al.
patent: 4939731 (1990-07-01), Reed et al.
patent: 5130993 (1992-07-01), Gutman et al.
patent: 5487068 (1996-01-01), Smolinske et al.
patent: 5627970 (1997-05-01), Keshav
Hamalainen Jari
Kanerva Mikko
Kari Hannu
Rasanen Juha
Vainikka Jari
Beaulieu Yonel
Nokia Telecommunications Oy
Zimmerman Brian
LandOfFree
Non-transparent data transmission in a digital telecommunication does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Non-transparent data transmission in a digital telecommunication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Non-transparent data transmission in a digital telecommunication will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-904733