CA2302501A1 - Data transmission system with relay stations between a source station and a target station - Google Patents
Data transmission system with relay stations between a source station and a target station Download PDFInfo
- Publication number
- CA2302501A1 CA2302501A1 CA002302501A CA2302501A CA2302501A1 CA 2302501 A1 CA2302501 A1 CA 2302501A1 CA 002302501 A CA002302501 A CA 002302501A CA 2302501 A CA2302501 A CA 2302501A CA 2302501 A1 CA2302501 A1 CA 2302501A1
- Authority
- CA
- Canada
- Prior art keywords
- channel
- station
- channels
- sub
- symbol
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/155—Ground-based stations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/155—Ground-based stations
- H04B7/15528—Control of operation parameters of a relay station to exploit the physical medium
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13098—Mobile subscriber
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13174—Data transmission, file transfer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13191—Repeater
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13291—Frequency division multiplexing, FDM
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13342—Arrangement of switches in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04Q—SELECTING
- H04Q2213/00—Indexing scheme relating to selecting arrangements in general and for multiplex systems
- H04Q2213/13367—Hierarchical multiplexing, add-drop multiplexing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Radio Relay Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Communication Control (AREA)
- Time-Division Multiplex Systems (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
A decentralized digital data transmission system has a large number of distributed stations which can only engage in direct data communication with neighbouring stations.
Stations located between a source station and a target station function as relay stations. Station to station transmission occurs in each case on different channels. In each station signals received by a reception channel are converted onto a different transmission channel. Conversion of a bit flow or symbol flow arriving at said reception channel is carried out on a bit-by-bit or symbol-by-symbol basis so that data is transmitted in a continuous flow without long delays occurring during conversion as is the case for transmission of data packets. A coupling matrix (KM) is used for conversion. Each channel (C1...Cn) is divided into a plurality of sub-channels (CH-1...CH-8). Transmission channels are allocated in such a way that each station uses wherever possible only sub-channels (SC1...SC8) located in the same channel.
Stations located between a source station and a target station function as relay stations. Station to station transmission occurs in each case on different channels. In each station signals received by a reception channel are converted onto a different transmission channel. Conversion of a bit flow or symbol flow arriving at said reception channel is carried out on a bit-by-bit or symbol-by-symbol basis so that data is transmitted in a continuous flow without long delays occurring during conversion as is the case for transmission of data packets. A coupling matrix (KM) is used for conversion. Each channel (C1...Cn) is divided into a plurality of sub-channels (CH-1...CH-8). Transmission channels are allocated in such a way that each station uses wherever possible only sub-channels (SC1...SC8) located in the same channel.
Description
DATA TRANSMISSION SYSTEM WITH RELAY STATIONS BETWEEN A
SOURCE STATION AND A TARGET STATION
The invention relates to a data transmission system for the digital transmission of data, including voice data.
A decentralised data transmission network with numerous dis-tributed stations is known from DE 33 37 648 C2, in which direct data communication takes place only between neighbou-ring stations. The transmission path from a source station to a target station is defined by a special routing system and the data are then transmitted from station to station in both directions on different channels. In this context, each of the stations transmits on a single channel, which is used only for linking exactly two stations. This, however, requires a corre-spondingly adapted data rate.
Packet-oriented data transmission between the stations of a data transmission network is also known from the Internet. In this case, data are grouped in packets and these packets are transmitted separately via the most favourable transmission path in each case. This kind of packet transmission causes considerable delays, which are at least equivalent to the time required to transmit one packet. Due to the associated delays, packet transmission of this kind is unfavourable for a tele-phone system. The delays would accumulate in accordance with the number of stations involved in transmission, particularly in a decentralised data transmission network which uses sta-tion-to-station transmission.
The object of the invention is to design a decentralised digi-tal data transmission system which enables the use of diffe-rent transmission channels between two stations and greatly minimises delays at the same time.
SOURCE STATION AND A TARGET STATION
The invention relates to a data transmission system for the digital transmission of data, including voice data.
A decentralised data transmission network with numerous dis-tributed stations is known from DE 33 37 648 C2, in which direct data communication takes place only between neighbou-ring stations. The transmission path from a source station to a target station is defined by a special routing system and the data are then transmitted from station to station in both directions on different channels. In this context, each of the stations transmits on a single channel, which is used only for linking exactly two stations. This, however, requires a corre-spondingly adapted data rate.
Packet-oriented data transmission between the stations of a data transmission network is also known from the Internet. In this case, data are grouped in packets and these packets are transmitted separately via the most favourable transmission path in each case. This kind of packet transmission causes considerable delays, which are at least equivalent to the time required to transmit one packet. Due to the associated delays, packet transmission of this kind is unfavourable for a tele-phone system. The delays would accumulate in accordance with the number of stations involved in transmission, particularly in a decentralised data transmission network which uses sta-tion-to-station transmission.
The object of the invention is to design a decentralised digi-tal data transmission system which enables the use of diffe-rent transmission channels between two stations and greatly minimises delays at the same time.
According to the invention, the object is solved by the featu-res specified in Patent Claim 1.
The data transmission system according to the invention is characterised in that the signals received at each station are converted symbol-by-symbol from the reception channels to at least one different transmission channel. This means that each symbol flow coming in on a reception channel is converted to the transmission channels. This process is similar to forming information packets consisting of a single symbol. In the simplest case, a symbol is one bit. However, it can also con-sist of a number of related bits, such as the eight bits re-presenting a letter symbol. During a transmission, the number of bits per symbol position is constant within a sub-channel.
The number of bits per symbol is defined at the beginning of transmission, depending on the required or desired degree of transmission quality. Symbol-by-symbol conversion means that only a delay equivalent to one symbol position of the symbol flow is required at each station. This delay is related to the fact that the symbol string on the incoming channels and the outgoing channels is normally not synchronised, meaning that a certain waiting time is required before the outgoing signal can be transmitted in synchrony with the transmission chan-nels. This delay, however, is minimal. In practice, it amounts to roughly one to two symbol positions. The delays of the individual stations accumulate. As a result of the minimal delay at each individual station, the resulting total delay of the transmission path is still acceptable.
According to a preferred configuration of the invention, the transmission channels are divided into sub-channels, each of which is suitable for transmitting a symbol flow and where the symbols of all sub-channels of a transmission channel are transmitted synchronously. This means that each station can receive incoming signals on all channels. The outgoing sub-channels can be transmitted in concentrated fashion on a sing-le channel or a few selected ones. The symbol positions of all sub-channels are transmitted synchronously on each channel, which consists of a pre-defined number of sub-channels. Each sub-channel supports unidirectional data flow. The data arrive at the station on each sub-channel of the entire channel sy-stem in a continuous data flow, without being divided into "frames" or "packets". Consequently, the data flow does not require headers or any other defining elements. Rather, each symbol of the data flow is converted to the sub-channel selec-ted for transmission within a very short time after reception and transmitted synchronously with the transmission channel.
The sub-channels are allocated to a transmission channel bet ween two stations such that the transmission frequency range is dynamically adapted to the information content to be trans mitted. This means that the number of sub-channels per channel is variable.
Preferably, allocation for transmitting envisaged channels occurs at a station in such a way that all transmitting sub-channels of this station are located within just a few chan-nels. This considerably reduces the number of channels to be used. In this context, it must be borne in mind that, if a station is transmitting on a channel, this channel cannot be used by neighbouring stations, in order to avoid interference or other disturbances . Even if a station uses only one sub-channel of a channel, the entire channel is reserved for this station. Therefore, all connections which run through a speci-fic station are preferably distributed over sub-channels all contained in the same channel.
In a preferred configuration of the invention, appropriate error correction bits are added to the contents of the syn-chronously transmitted symbol positions of the sub-channels of a channel, and error correction is carried out at the recei-ving station, in order to reduce the probability of error in the data link. Known methods can be used for error correction, such as the FEC method (Forward Error Correction) or the ARQ
method (Automatic Re-transmission Request). The special featu-re in the present case is that the contents of the synchro-nously transmitted symbol positions of the sub-channels of a channel are used for error correction, where completely inde-pendent information contents flow in the sub-channels. This means that error correction is carried out on the basis of bits which are associated with different information and which merely happen to be located at the synchronous positions of the channel.
The use of an error correction method is only sensible if a bit error ratio of less than roughly 10-3 is to be achieved.
Simple error detection is adequate for higher bit error ra-tios, in order to at least obtain information on the quality of the connection between the two participating stations.
Error detection of this kind can be provided by a redundant error control element (e. g. parity bit), this error control element being added to the synchronously transmitted symbol positions of all sub-channels of a channel. It is alternative-ly or additionally possible, after each transmission of a pre-defined number of symbol positions of a sub-channel, to gene-rate an error detection bit for each sub-channel, which corre-sponds to the consecutive information contents of this sub-channel, error detection being carried out at the receiving station.
A practical example of the invention is described in more detail below based on the drawings.
The drawings show the following:
Fig. 1 A diagram of part of the data transmission system showing the distributed stations, Fig. 2 An example of a connection from a source station to a target station, Fig. 3 A coupling matrix for frequency conversion at each station, Fig. 4 An example of data flows running through the coup-ling matrix shown in Fig. 3, and Fig. 5 A diagram of the consecutive symbol positions in a 5 channel with error correction bits and error detec tion bits.
The data transmission system consists of numerous distributed stations S, where each station represents a subscriber posi-tion. Each station contains transmitting and receiving equip-ment. Two frequency bands of 12.8 MHz each are available for radio transmission of the data. The two frequency bands are separated from one another by duplex spacing. One frequency band is designated as the uplink and the other as the down-link. In order to establish a connection, a channel in the uplink is used for the connection in the one direction and a channel in the downlink for the connection in the other direc-tion, so that the two directions are completely decoupled from one another in terms of frequency.
In this practical example, the two frequency bands of 12.8 MHz bandwidth each are divided into a total of 1,280 channels with a width of 20 kHz. Some of these channels are used as informa-tion channels for establishing a connection and for other purposes. Each station can receive on any of the available channels and transmit on any of the available channels.
In Fig. 1, it is assumed that a connection is to be establis-hed between a source station S61 and a target station 565.
This connection runs via stations S60 and 563, which act as relay stations. In addition, a connection from station S62 to Station S64 is relayed by station 560.
In the example of an established connection shown in Fig. 2, data transmission from S61 takes place on channel C1, data transmission from S60 to S63 on channel C25 and data trans-mission from S63 to target station S65 on channel C12. Station 560, which is given special consideration in this example, also transmits on channel C25 for stations S61 and 564.
Routing, i.e. selection of the stations through which the connection is to be established, and selection of the channels are handled by way of a dialogue conducted between the parti-cipating stations. Routing (path-finding) and establishment of the connection are not the object of the present invention.
Figure 3 shows a coupling matrix KM, which is contained in each station. For reasons of simplicity, each symbol position represented by a box is assumed to consist of one bit in this practical example.
Each station contains a channel register CR-1...CR-n for every channel C1.:.Cn. Channel register CR-1 contains eight informa-tion symbol positions 1...8, where each of the symbol posi-tions corresponds to one sub-channel SC. Thus, channel C1 is divided into eight sub-channels 1...8. Each sub-channel has a bandwidth of 20 kHz, where the frequencies of all sub-channels 1-8 are consecutive. A unidirectional data link can be estab-lished over one sub-channel SC.
Figure 3 shows the time-slot patterns for sub-channels 4 and 5 of channel C1, in which symbols are transmitted to channel register 1. Transmission takes place at a frequency of 20 kHz in a continuous symbol flow.
The synchronously received symbols (in this case: bits) of the sub-channels of a channel enter a receiving register ER1...ERn and are transmitted from there to the respective channel regi-ster CR-l...CR-n with a delay of two symbol durations. Channel registers CR-1 ...CR-n are each associated with the columns of the coupling matrix. The coupling matrix has n rows and m columns, where each row and each column is assigned to a dif-ferent sub-channel and a different frequency. The rows of coupling matrix KM each correspond to one sub-channel or transmitting frequency. Each channel has one channel register CR-1...CR-n, which contains one symbol position for each sub-channel 1...8. The symbol positions of all transmission-side channel registers are associated with the rows of coupling matrix KM. Each transmission-side channel register CR-l...CR-n is assigned a transmission register SR1...SRn.
Coupling matrix KM is of integrated circuit design, where corresponding control signals can connect the nodes to the intersections of a row and a column. The associated node re-mains connected during connection.
In the practical example shown, it is assumed that the infor-mation received on sub-channel No. 1 of channel C1 is to be relayed on sub-channel No. 2 of channel 25. There is a connec-ted node KP at the associated intersection of the coupling matrix, so that the bit located in position No. 1 of receiving channel register CR-1 is transmitted to position No. 2 of transmitting channel register CR-25 for channel C25.
In the same way, the signals received on sub-channel No. 4 of channel C2 are transmitted to sub-channel No. 6 of channel C25 and sent out on this channel.
Figure 4 shows an example of the timing of signals received on the sub-channels of channels C1, C2 and C3. At the associated station, such as station S60 in Figs. 1 and 2, the signals received there and intended for relaying are converted to channel C25. For station S60, a dialogue with the neighbouring stations previously determined that channel C25 is available for data transmission.
As Fig. 2 shows for the selected practical example, station S60 receives the data from station S61 on channel Cl which it is supposed to relay to station 563. Consequently, these data are converted to channel C25 at station S60. At station 563, the same data are converted to another channel, such as C12, and transmitted to target station 565.
In the selected example, station S60 considered here receives signals from station S62 on channel C2. These signals are to be relayed to station 564. Channel C25 is again selected for this purpose. Finally, signals are also to be transmitted from station S60 to station.S6l, for which purpose another sub-s channel of channel C25 is selected. Everything station S60 transmits is on channel C25, but on different sub-channels.
Figure 4 shows the conversion of the data at station S60, which were received by stations S61 and S62 on channels C1 and C2. These data are converted to channel C25, but to different sub-channels. In this context, the time axis is designated as "t" in each case. The top line of Fig. 4 shows that the symbol positions transmitted on channels C1, C2 and C3 are delayed relative to one another by a maximum of the duration of one symbol position. For this reason, the data are retained in channel register CR-1...CR-n (Fig. 3) until the associated symbol position has been received for all channels. Conversion to the outgoing channels is then carried out simultaneously in coupling matrix KM.
In addition to the symbol positions of sub-channels 1...8, which transmit the information, three other bit positions have been added to each channel for error correction bits A, B, C.
The contents of these additional bit positions are analysed in receiving register ER1...ERn and used to correct errors in the information bits received simultaneously on one channel. Only the corrected information bits are entered in the correspon-ding channel register CR-l...CR-n.
In transmission registers SRl...SRn, error detection bits A, B, C are added to the eight information symbols of a channel, before the entire bit volume is transmitted. These error de-tection bits are generated by an error detection algorithm in accordance with the contents of the information symbol posi-tions. After receiving the entire signal, error correction is performed in the same way using the algorithm.
The data transmission system according to the invention is characterised in that the signals received at each station are converted symbol-by-symbol from the reception channels to at least one different transmission channel. This means that each symbol flow coming in on a reception channel is converted to the transmission channels. This process is similar to forming information packets consisting of a single symbol. In the simplest case, a symbol is one bit. However, it can also con-sist of a number of related bits, such as the eight bits re-presenting a letter symbol. During a transmission, the number of bits per symbol position is constant within a sub-channel.
The number of bits per symbol is defined at the beginning of transmission, depending on the required or desired degree of transmission quality. Symbol-by-symbol conversion means that only a delay equivalent to one symbol position of the symbol flow is required at each station. This delay is related to the fact that the symbol string on the incoming channels and the outgoing channels is normally not synchronised, meaning that a certain waiting time is required before the outgoing signal can be transmitted in synchrony with the transmission chan-nels. This delay, however, is minimal. In practice, it amounts to roughly one to two symbol positions. The delays of the individual stations accumulate. As a result of the minimal delay at each individual station, the resulting total delay of the transmission path is still acceptable.
According to a preferred configuration of the invention, the transmission channels are divided into sub-channels, each of which is suitable for transmitting a symbol flow and where the symbols of all sub-channels of a transmission channel are transmitted synchronously. This means that each station can receive incoming signals on all channels. The outgoing sub-channels can be transmitted in concentrated fashion on a sing-le channel or a few selected ones. The symbol positions of all sub-channels are transmitted synchronously on each channel, which consists of a pre-defined number of sub-channels. Each sub-channel supports unidirectional data flow. The data arrive at the station on each sub-channel of the entire channel sy-stem in a continuous data flow, without being divided into "frames" or "packets". Consequently, the data flow does not require headers or any other defining elements. Rather, each symbol of the data flow is converted to the sub-channel selec-ted for transmission within a very short time after reception and transmitted synchronously with the transmission channel.
The sub-channels are allocated to a transmission channel bet ween two stations such that the transmission frequency range is dynamically adapted to the information content to be trans mitted. This means that the number of sub-channels per channel is variable.
Preferably, allocation for transmitting envisaged channels occurs at a station in such a way that all transmitting sub-channels of this station are located within just a few chan-nels. This considerably reduces the number of channels to be used. In this context, it must be borne in mind that, if a station is transmitting on a channel, this channel cannot be used by neighbouring stations, in order to avoid interference or other disturbances . Even if a station uses only one sub-channel of a channel, the entire channel is reserved for this station. Therefore, all connections which run through a speci-fic station are preferably distributed over sub-channels all contained in the same channel.
In a preferred configuration of the invention, appropriate error correction bits are added to the contents of the syn-chronously transmitted symbol positions of the sub-channels of a channel, and error correction is carried out at the recei-ving station, in order to reduce the probability of error in the data link. Known methods can be used for error correction, such as the FEC method (Forward Error Correction) or the ARQ
method (Automatic Re-transmission Request). The special featu-re in the present case is that the contents of the synchro-nously transmitted symbol positions of the sub-channels of a channel are used for error correction, where completely inde-pendent information contents flow in the sub-channels. This means that error correction is carried out on the basis of bits which are associated with different information and which merely happen to be located at the synchronous positions of the channel.
The use of an error correction method is only sensible if a bit error ratio of less than roughly 10-3 is to be achieved.
Simple error detection is adequate for higher bit error ra-tios, in order to at least obtain information on the quality of the connection between the two participating stations.
Error detection of this kind can be provided by a redundant error control element (e. g. parity bit), this error control element being added to the synchronously transmitted symbol positions of all sub-channels of a channel. It is alternative-ly or additionally possible, after each transmission of a pre-defined number of symbol positions of a sub-channel, to gene-rate an error detection bit for each sub-channel, which corre-sponds to the consecutive information contents of this sub-channel, error detection being carried out at the receiving station.
A practical example of the invention is described in more detail below based on the drawings.
The drawings show the following:
Fig. 1 A diagram of part of the data transmission system showing the distributed stations, Fig. 2 An example of a connection from a source station to a target station, Fig. 3 A coupling matrix for frequency conversion at each station, Fig. 4 An example of data flows running through the coup-ling matrix shown in Fig. 3, and Fig. 5 A diagram of the consecutive symbol positions in a 5 channel with error correction bits and error detec tion bits.
The data transmission system consists of numerous distributed stations S, where each station represents a subscriber posi-tion. Each station contains transmitting and receiving equip-ment. Two frequency bands of 12.8 MHz each are available for radio transmission of the data. The two frequency bands are separated from one another by duplex spacing. One frequency band is designated as the uplink and the other as the down-link. In order to establish a connection, a channel in the uplink is used for the connection in the one direction and a channel in the downlink for the connection in the other direc-tion, so that the two directions are completely decoupled from one another in terms of frequency.
In this practical example, the two frequency bands of 12.8 MHz bandwidth each are divided into a total of 1,280 channels with a width of 20 kHz. Some of these channels are used as informa-tion channels for establishing a connection and for other purposes. Each station can receive on any of the available channels and transmit on any of the available channels.
In Fig. 1, it is assumed that a connection is to be establis-hed between a source station S61 and a target station 565.
This connection runs via stations S60 and 563, which act as relay stations. In addition, a connection from station S62 to Station S64 is relayed by station 560.
In the example of an established connection shown in Fig. 2, data transmission from S61 takes place on channel C1, data transmission from S60 to S63 on channel C25 and data trans-mission from S63 to target station S65 on channel C12. Station 560, which is given special consideration in this example, also transmits on channel C25 for stations S61 and 564.
Routing, i.e. selection of the stations through which the connection is to be established, and selection of the channels are handled by way of a dialogue conducted between the parti-cipating stations. Routing (path-finding) and establishment of the connection are not the object of the present invention.
Figure 3 shows a coupling matrix KM, which is contained in each station. For reasons of simplicity, each symbol position represented by a box is assumed to consist of one bit in this practical example.
Each station contains a channel register CR-1...CR-n for every channel C1.:.Cn. Channel register CR-1 contains eight informa-tion symbol positions 1...8, where each of the symbol posi-tions corresponds to one sub-channel SC. Thus, channel C1 is divided into eight sub-channels 1...8. Each sub-channel has a bandwidth of 20 kHz, where the frequencies of all sub-channels 1-8 are consecutive. A unidirectional data link can be estab-lished over one sub-channel SC.
Figure 3 shows the time-slot patterns for sub-channels 4 and 5 of channel C1, in which symbols are transmitted to channel register 1. Transmission takes place at a frequency of 20 kHz in a continuous symbol flow.
The synchronously received symbols (in this case: bits) of the sub-channels of a channel enter a receiving register ER1...ERn and are transmitted from there to the respective channel regi-ster CR-l...CR-n with a delay of two symbol durations. Channel registers CR-1 ...CR-n are each associated with the columns of the coupling matrix. The coupling matrix has n rows and m columns, where each row and each column is assigned to a dif-ferent sub-channel and a different frequency. The rows of coupling matrix KM each correspond to one sub-channel or transmitting frequency. Each channel has one channel register CR-1...CR-n, which contains one symbol position for each sub-channel 1...8. The symbol positions of all transmission-side channel registers are associated with the rows of coupling matrix KM. Each transmission-side channel register CR-l...CR-n is assigned a transmission register SR1...SRn.
Coupling matrix KM is of integrated circuit design, where corresponding control signals can connect the nodes to the intersections of a row and a column. The associated node re-mains connected during connection.
In the practical example shown, it is assumed that the infor-mation received on sub-channel No. 1 of channel C1 is to be relayed on sub-channel No. 2 of channel 25. There is a connec-ted node KP at the associated intersection of the coupling matrix, so that the bit located in position No. 1 of receiving channel register CR-1 is transmitted to position No. 2 of transmitting channel register CR-25 for channel C25.
In the same way, the signals received on sub-channel No. 4 of channel C2 are transmitted to sub-channel No. 6 of channel C25 and sent out on this channel.
Figure 4 shows an example of the timing of signals received on the sub-channels of channels C1, C2 and C3. At the associated station, such as station S60 in Figs. 1 and 2, the signals received there and intended for relaying are converted to channel C25. For station S60, a dialogue with the neighbouring stations previously determined that channel C25 is available for data transmission.
As Fig. 2 shows for the selected practical example, station S60 receives the data from station S61 on channel Cl which it is supposed to relay to station 563. Consequently, these data are converted to channel C25 at station S60. At station 563, the same data are converted to another channel, such as C12, and transmitted to target station 565.
In the selected example, station S60 considered here receives signals from station S62 on channel C2. These signals are to be relayed to station 564. Channel C25 is again selected for this purpose. Finally, signals are also to be transmitted from station S60 to station.S6l, for which purpose another sub-s channel of channel C25 is selected. Everything station S60 transmits is on channel C25, but on different sub-channels.
Figure 4 shows the conversion of the data at station S60, which were received by stations S61 and S62 on channels C1 and C2. These data are converted to channel C25, but to different sub-channels. In this context, the time axis is designated as "t" in each case. The top line of Fig. 4 shows that the symbol positions transmitted on channels C1, C2 and C3 are delayed relative to one another by a maximum of the duration of one symbol position. For this reason, the data are retained in channel register CR-1...CR-n (Fig. 3) until the associated symbol position has been received for all channels. Conversion to the outgoing channels is then carried out simultaneously in coupling matrix KM.
In addition to the symbol positions of sub-channels 1...8, which transmit the information, three other bit positions have been added to each channel for error correction bits A, B, C.
The contents of these additional bit positions are analysed in receiving register ER1...ERn and used to correct errors in the information bits received simultaneously on one channel. Only the corrected information bits are entered in the correspon-ding channel register CR-l...CR-n.
In transmission registers SRl...SRn, error detection bits A, B, C are added to the eight information symbols of a channel, before the entire bit volume is transmitted. These error de-tection bits are generated by an error detection algorithm in accordance with the contents of the information symbol posi-tions. After receiving the entire signal, error correction is performed in the same way using the algorithm.
Figure 5 shows a channel's individual symbol positions in relation to their timing, where the numbers 1...8 refer to the information symbol positions and represent sub-channels. These sub-channels have different frequencies. In Fig. 5, frequency f increases from left to right with increasing ordinal number.
The three error correction bit positions A, B, C have been added to the last sub-channel (channel "8").
In the practical example shown in Fig. 5, a total of eight consecutive symbols in the channel is followed by an addi-tional symbol position P, which contains a parity bit for each sub-channel that also serves the purpose of error detection.
The addition of the error detection bits and the error correc-tion bits, and the analysis of these bits on the basis of the information content, are carried out separately for each transmission link. These additional bits are not involved in frequency conversion.
As an alternative to the practical example described above, in which the assignment of the sub-channels to the frequencies is fixed, the assignment of the sub-channels to the frequencies can be changed after each symbol step. This makes it possible to ensure that a disturbance cannot permanently interfere with a sub-channel.
The three error correction bit positions A, B, C have been added to the last sub-channel (channel "8").
In the practical example shown in Fig. 5, a total of eight consecutive symbols in the channel is followed by an addi-tional symbol position P, which contains a parity bit for each sub-channel that also serves the purpose of error detection.
The addition of the error detection bits and the error correc-tion bits, and the analysis of these bits on the basis of the information content, are carried out separately for each transmission link. These additional bits are not involved in frequency conversion.
As an alternative to the practical example described above, in which the assignment of the sub-channels to the frequencies is fixed, the assignment of the sub-channels to the frequencies can be changed after each symbol step. This makes it possible to ensure that a disturbance cannot permanently interfere with a sub-channel.
Claims (4)
1. Data transmission system with distributed stations (S) which can only engage in direct data communication with neighbouring stations on selectable transmission channels, where a symbol flow consisting of consecutive symbols is transmitted via the channel and where stations located between a source station and a target station function as relay stations, characterised in that the signals received at each station (S) are converted from the respective reception channel to a different transmission channel, the conversion of the symbol flow arriving on the reception channel to the transmission channel taking place symbol-by-symbol.
2. Data transmission system as per Claim 1, characterised in that the transmission channels are divided into sub-channels (SC), each of which is suitable for transmitting a symbol flow, and that the symbols of all sub-channels (SC1...SC8) of a transmission channel are transmitted synchronously.
3. Data transmission system as per Claim 2, characterised in that bits (A, B, C) are added to the synchronously transmitted symbol positions of the sub-channels (SC1...SC8) of a channel based on the information contents of these symbol positions, where error detection and/or error correction is carried out at the receiving station.
4. Data transmission system as per Claim 2 or 3, characterised in that error detection and/or error correction is carried out on each individual sub-channel via a predefined number of symbol positions.
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
DE19737897.8 | 1997-08-29 | ||
DE19737897A DE19737897C2 (en) | 1997-08-29 | 1997-08-29 | Data transmission system |
PCT/EP1998/005451 WO1999012279A1 (en) | 1997-08-29 | 1998-08-27 | Data transmission system with relay stations between a source station and a target station |
Publications (1)
Publication Number | Publication Date |
---|---|
CA2302501A1 true CA2302501A1 (en) | 1999-03-11 |
Family
ID=7840681
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CA002302501A Abandoned CA2302501A1 (en) | 1997-08-29 | 1998-08-27 | Data transmission system with relay stations between a source station and a target station |
Country Status (11)
Country | Link |
---|---|
EP (1) | EP1010261A1 (en) |
JP (1) | JP2001515297A (en) |
KR (1) | KR20010023447A (en) |
CN (1) | CN1269076A (en) |
AU (1) | AU9739598A (en) |
CA (1) | CA2302501A1 (en) |
CZ (1) | CZ288768B6 (en) |
DE (1) | DE19737897C2 (en) |
HU (1) | HUP0002405A3 (en) |
IL (1) | IL134265A0 (en) |
WO (1) | WO1999012279A1 (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7349339B2 (en) | 2000-12-14 | 2008-03-25 | 7 Layers Ag | Method for operating an ad-hoc network for the wireless data transmissions of synchronous and asynchronous messages |
Families Citing this family (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1812283B (en) * | 2005-01-26 | 2010-09-15 | 北京邮电大学 | Power distributing method for two-jumping multi-antenna relay system |
DE102005049103A1 (en) * | 2005-10-13 | 2007-04-19 | Siemens Ag | Radio communication with a repeater |
KR20080095268A (en) * | 2006-02-01 | 2008-10-28 | 파나소닉 주식회사 | Radio station, radio transmission method of the radio station, and radio transmission system using the radio station |
US8000283B2 (en) | 2007-03-07 | 2011-08-16 | Motorola Solutions, Inc. | Method and apparatus for relay station neighbor discovery |
CN101843067A (en) * | 2007-10-30 | 2010-09-22 | 京瓷株式会社 | Wireless communication system, base station, terminal and wireless communication method |
CN101820305B (en) * | 2010-04-21 | 2013-04-10 | 西安上尚机电有限公司 | Airborne communication relay and reconnaissance system |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
DE3337648A1 (en) * | 1983-10-17 | 1987-02-26 | Licentia Gmbh | Radio network with a multiplicity of mobile stations |
JPH02137552A (en) * | 1988-11-18 | 1990-05-25 | Fujitsu Ltd | Relay receiver |
FR2657204A2 (en) * | 1989-08-29 | 1991-07-19 | Matra Communication | RADIO-TELEPHONE COMMUNICATION NETWORK. |
-
1997
- 1997-08-29 DE DE19737897A patent/DE19737897C2/en not_active Expired - Fee Related
-
1998
- 1998-08-27 WO PCT/EP1998/005451 patent/WO1999012279A1/en not_active Application Discontinuation
- 1998-08-27 JP JP2000509171A patent/JP2001515297A/en active Pending
- 1998-08-27 CN CN98808619A patent/CN1269076A/en active Pending
- 1998-08-27 CA CA002302501A patent/CA2302501A1/en not_active Abandoned
- 1998-08-27 HU HU0002405A patent/HUP0002405A3/en unknown
- 1998-08-27 IL IL13426598A patent/IL134265A0/en unknown
- 1998-08-27 AU AU97395/98A patent/AU9739598A/en not_active Abandoned
- 1998-08-27 KR KR1020007002090A patent/KR20010023447A/en not_active Application Discontinuation
- 1998-08-27 EP EP98951322A patent/EP1010261A1/en not_active Withdrawn
- 1998-08-27 CZ CZ2000672A patent/CZ288768B6/en not_active IP Right Cessation
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7349339B2 (en) | 2000-12-14 | 2008-03-25 | 7 Layers Ag | Method for operating an ad-hoc network for the wireless data transmissions of synchronous and asynchronous messages |
Also Published As
Publication number | Publication date |
---|---|
EP1010261A1 (en) | 2000-06-21 |
IL134265A0 (en) | 2001-04-30 |
KR20010023447A (en) | 2001-03-26 |
CZ288768B6 (en) | 2001-08-15 |
HUP0002405A2 (en) | 2000-11-28 |
DE19737897C2 (en) | 1999-07-22 |
WO1999012279A1 (en) | 1999-03-11 |
HUP0002405A3 (en) | 2003-01-28 |
JP2001515297A (en) | 2001-09-18 |
CZ2000672A3 (en) | 2000-07-12 |
CN1269076A (en) | 2000-10-04 |
AU9739598A (en) | 1999-03-22 |
DE19737897A1 (en) | 1999-03-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7349339B2 (en) | Method for operating an ad-hoc network for the wireless data transmissions of synchronous and asynchronous messages | |
CN100403709C (en) | System and method for broadband millimeter wave data communication | |
EP0444592B1 (en) | Multidirection multiplex communication system | |
US6424645B1 (en) | TDMA radio communication system achieving simultaneous assignment of channels to multiple terminal stations | |
KR910002016B1 (en) | Wireless network for wideband indoor communications | |
CA1220883A (en) | Base-band equipment for earth stations of a time division multiple access satellite transmission system | |
EP0282028A2 (en) | Multiple access communication system | |
NO333403B1 (en) | Method and system for communication in seismic data collection | |
US4105973A (en) | Multibeam, digitally modulated, time division, switched satellite communications system | |
EP0820208A2 (en) | Packetized CDMA/TDM satellite communication system | |
KR20010087367A (en) | Broadband wireless mesh topology network | |
CA2302501A1 (en) | Data transmission system with relay stations between a source station and a target station | |
EP0359261B1 (en) | Subsignal transmitting system | |
JPS6041341A (en) | Time division bidirectional transmission system | |
US4715026A (en) | Circuit arrangement for a communications system for the transmission of message information from narrowband and broadband terminal equipment within a local network constructed as a loop | |
JP2882176B2 (en) | Time division multiplex digital wireless communication system | |
US5113394A (en) | Method for repeating TDM/TDMA frames | |
CA1168392A (en) | Data transmission | |
US6347092B1 (en) | Time division multiple access communication system, signal receiving method in time division multiple access communication system, and center unit for use in time division multiple access communication system | |
US20040030792A1 (en) | Communication apparatus and method | |
JP3166029B2 (en) | Digital wireless communication device | |
EP0227341B1 (en) | Time division multiple access communications terminal | |
JP3161877B2 (en) | Centralized control radio base station equipment | |
KR920001549B1 (en) | Apparatus and method for obtaining frequency agility in digital communication systems | |
RU2237366C2 (en) | Communication system and method for assigning time intervals and frequency channels |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
FZDE | Discontinued |