IPC분류정보
국가/구분 |
United States(US) Patent
등록
|
국제특허분류(IPC7판) |
|
출원번호 |
US-0426785
(2003-05-01)
|
등록번호 |
US-7471695
(2008-12-30)
|
우선권정보 |
DE-102 19 700(2002-05-02) |
발명자
/ 주소 |
|
출원인 / 주소 |
|
대리인 / 주소 |
|
인용정보 |
피인용 횟수 :
0 인용 특허 :
12 |
초록
▼
A method for providing and transmitting data in a data transmission system by transmitting several data blocks from a data-transmitting device to terminals. Before transmission of the data to the terminals an interleaving process of at least two data blocks is conducted. For the purpose of interleav
A method for providing and transmitting data in a data transmission system by transmitting several data blocks from a data-transmitting device to terminals. Before transmission of the data to the terminals an interleaving process of at least two data blocks is conducted. For the purpose of interleaving for each data unit of the data blocks, a transmission time is established with the help of an algorithm in such a way that for the transmission of k time critical data blocks with k=2, 3, 4, . . . and for one non-time critical data block, the transmission times of the data units of each time critical data block are respectively set at a fraction 1/k of the transmission time of the non-critical data block.
대표청구항
▼
The invention claimed is: 1. A method for providing and transmitting data in a data transmission system, said method comprising the steps of: forming a plurality of data blocks, including time-critical data blocks and a non-time-critical data block, with each of said data blocks having at least one
The invention claimed is: 1. A method for providing and transmitting data in a data transmission system, said method comprising the steps of: forming a plurality of data blocks, including time-critical data blocks and a non-time-critical data block, with each of said data blocks having at least one data unit; interleaving each of said at least one data unit of at least two of said plurality of data blocks by establishing a transmission time for said data units as a function of an algorithm in order to transmit k time critical data blocks of said plurality of data blocks with k being an integer greater than or equal to 2, concurrently with transmission of said non-time-critical data block during a transmission time for said non-time critical data block, wherein the transmission time of the data units that constitute each time critical data block is respectively set at a fraction 1/k of said transmission time of the non-time-critical data block; subsequent to said step of interleaving, transmitting said plurality of data blocks from a data transmitting device to terminals of said data transmission system. 2. The method according to claim 1, wherein data constituting the respective data blocks are divided into equal packets with indexed data addresses within each packet, and the interleaving process is performed through the successive transmission of data units from each packet, having the same independent data address within the respective packets. 3. The method according to claim 2, wherein initially the data units of all packets with lowest or highest data address are transmitted successively and then successively the data units of all packets with next higher or next lower data address are transmitted. 4. The method according to claim 3, wherein at least a first group of packets is reserved for data blocks with time critical data and at least a second group of packets is reserved for data blocks with non-time critical data. 5. The method according to claim 3, wherein status messages or headers are transmitted as time critical data and informative data are transmitted as non-time critical data. 6. The method according to claim 3, wherein an amount of time critical data is no greater than half the amount of non-time critical data. 7. The method according to claim 2, wherein at least a first group of packets is reserved for said time critical data blocks, and at least a second group of packets is reserved for said non-time critical data block. 8. The method according to claim 7, wherein packets of the first group of packets are filled with n/k, k=2, 3, 4, 5 . . . data units of a data block of time critical data, n being the number of data units in each packet; and packets of the second group of packets are filled with n data units of a data block of non-time critical data. 9. The method according to claim 7, wherein status messages or headers are transmitted as time critical data and informative data are transmitted as non-time critical data. 10. The method according to claim 7, wherein an amount of time critical data is no greater than half the amount of non-time critical data. 11. The method according to claim 2, wherein status messages or headers are transmitted as time critical data and informative data are transmitted as non-time critical data. 12. The method according to claim 2, wherein an amount of time critical data is no greater than half the amount of non-time critical data. 13. The method according to claim 1, wherein status messages or headers are transmitted as time critical data, and informative data are transmitted as non-time critical data. 14. The method according to claim 13, wherein: packets of the first group of packets are filled with n/k, k=2, 3, 4, 5 . . . data units of a data block of time critical data, n being the number of data units in each packet; and packets of the second group of packets are filled with n data units of a data block of non-time critical data. 15. The method according to claim 1, wherein an amount of time critical data is no greater than half the amount of non-time critical data. 16. The method according to claim 15, wherein the amount of time critical data is no greater than a quarter of the amount of non-time critical data. 17. A computer readable medium encoded with a computer program comprising computer executable instructions for causing a computer to perform the following method steps for providing and transmitting data in a data transmission system: forming a plurality of data blocks, including time-critical data blocks and a non-time-critical data block, with each of said data blocks having at least one data unit; interleaving each of said at least one data unit of at least two of said plurality of data blocks by establishing a transmission time for said data units as a function of an algorithm in order to transmit k time critical data blocks of said plurality of data blocks with k being an integer greater than or equal to 2, concurrently with transmission of said non-time-critical data block during a transmission time for said non-time critical data block, wherein the transmission time of the data units that constitute each time critical data block is respectively set at a fraction 1/k of said transmission time of the non-time-critical data block; subsequent to said step of interleaving, transmitting said plurality of data blocks from a data transmitting device to terminals of said data transmission system. 18. A method of transmitting data comprising a plurality of data blocks including k time-critical data blocks, k being an integer greater than or equal to 2, and one non-time-critical data block, each of said data blocks including at least one data unit, said method comprising: forming a plurality of data packets, each having a length of n data units; reserving at least two data packets for data units of said time-critical data blocks, and at least one of said data packets for data units of non-time-critical data blocks; filling said at least one data packet that is reserved for data units of said non-time-critical data blocks continuously and sequentially with data units of said non-time-critical data block; and filling said at least two packets that are reserved for data units of said time-critical data blocks by filling each packet with n/k data units for a first time-critical data block, and the remaining length of said at least two data packets consecutively with n/k data units of each remaining one of the time-critical data blocks; transmitting data units of said data packets during a transmission period according to an interleaving process in which data for each particular packet address are transmitted sequentially as among the respective packets, whereby data of the k time-critical data blocks is transmitted during a different 1/k portion of the transmission period.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.