JP5600774B1 - Data transmission apparatus and method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To obtain a decoding time by estimating a decoding processing time in real time, obtaining optimum parameters such as an arbitrary coding rate, a packet loss rate, and a code length.
The present invention encodes transmission data using a check matrix and transmits a transmission packet at a predetermined rate and is connected to a network, receives the transmission packet, and performs lost packet recovery processing. A receiver including a decoding unit, a parameter design for minimizing a decoding time of transmission data of the receiver based on an input check matrix, and a code parameter designer for outputting an optimal packet loss rate; The transmission packet received from the transmitter is intentionally lost based on the difference between the optimum packet loss rate given from the code parameter design unit and the naturally occurring packet loss rate. And a coding rate controller for sending to the receiver.
[Selection] Figure 1

Description

  The present invention relates to a data transmission apparatus and method, and more particularly, to a data transmission apparatus and method for achieving a transmission rate optimum for a packet loss rate of a network using an error correction code.

  Unlike conventional telephone networks, IP (Internet Protocol) networks are basically premised on connectionless orientation, and are provided as upper layer functions such as TCP (Transmission Control Protocol) when connection establishment is required. Is done. In TCP, detection of occurrence of packet loss on a network is realized by feedback notification (Ack notification), and loss compensation is realized by retransmission control. However, in video transmission and the like where real-time performance is important, there is no time for performing retransmission control or the like. In the case of broadcast delivery such as multicast, retransmission control is substantially impossible because of the large number of receivers for the transmitter.

  In such cases, transmission using UDP (User Datagram Protocol) and Forward Error Correction (FEC) code, which is a connectionless method, is not a packet loss compensation method based on retransmission control such as TCP. Is used. A UDP communication channel can be regarded as a binary erasure channel (BEC).

  In recent years, LDPC (Low-density Parity-check) codes have been widely used as FECs that are actually used with UDP. The LDPC code has features such that both code processing and decoding processing can be processed in a linear time for a large code length, is easy to implement, and the coding rate can be set flexibly. Here, the coding rate (r) is the ratio of the original information packet (k) to the total number of packets (n) to be transmitted, and r = k / n. The total number of packets to be transmitted is the sum of the original number of information packets (= k) and the number of parity packets (= m). From the definition, the range of r is 0 <r <1, and when the coding rate is close to 1, there are almost no parity bits, and conversely as the value approaches 0, the percentage of parity packets increases and the redundancy is high.

  When FEC is used for UDP transmission, it is necessary to determine the optimum coding rate according to the packet loss probability on the network. Actually, since the rate at which packets are lost on the network and the transfer delay time change with time, it is necessary to change the encoding rate without re-encoding (see Patent Document 1, for example). As a technique for that purpose, a puncture code system based on an LDPC code has been proposed (for example, see Non-Patent Document 1).

  Puncturing is a technique for controlling the code rate (redundancy) with an error correction code by intentionally not sending some transmission packets. An error correction code generates a parity symbol (in this specification, a packet corresponds to a symbol, and is referred to as a “packet” hereinafter), and transmits this parity packet in addition to the original information packet. This technique can restore the original information packet even if some packet loss occurs. How much parity packets are added is represented by an index called a coding rate. Since this encoding rate needs to be determined before encoding, the encoding rate cannot be changed after encoding. When the coding rate is low, that is, when the ratio of the parity packet is large with respect to the original information packet, it has durability against many packet losses, but on the other hand, the amount of packets to be transmitted becomes large. If packet loss does not occur so much on the network, if the coding rate is low (the amount of parity is large), it means that useless packets are being sent, and transmission efficiency deteriorates. Therefore, the amount of transmitted packets can be reduced by intentionally not sending packets to be transmitted after encoding once. This is called puncture. From the viewpoint of error correction codes, this corresponds to increasing the coding rate (that is, reducing the number of parity packets).

JP 2006-13714 A

Pishro-Nik, H, Fekri, F., "Results on punctured LDPC codes", Information Theory Workshop, 2004. IEEE, pp.215-219.

 In the case of an LDPC code in which the coding rate is changed using the puncture as described above, the decoding processing time of the LDPC code varies depending on the number of packet loss on the network. This is because the error correction code performs recovery processing for the number of lost packets. When high bit rate and real-time performance are required as in video transmission, it is necessary to finish LDPC decoding within a certain delay time. Therefore, when the available bandwidth of the network is determined, it is desirable to complete LDPC decoding in the shortest time in that bandwidth.

  However, when constructing a real-time transmission system using an LDPC code that can control the coding rate by such puncturing, it is necessary to determine the range of the packet loss rate on the assumed network and satisfy the above requirements. The LDPC code and transmission parameters must be determined.

  The present invention has been made in view of the above points, and it is possible to estimate the decoding time in real time, obtain parameters such as an arbitrary coding rate, packet loss rate, and code length, and obtain the decoding time. An object is to provide a data transmission apparatus and method.

According to one aspect of the present invention, there is provided a data transmission system for obtaining an optimum transmission rate for a packet loss rate of a network using an error correction code,
A transmitter that encodes transmission data using a check matrix and transmits transmission packets at a predetermined rate;
A receiver connected to a network, including a decoding means for receiving a transmission packet and performing recovery processing of a lost packet;
Based on the input check matrix, a parameter design for minimizing the decoding time of the transmission data of the receiver, and a code parameter design unit for outputting an optimal packet loss rate,
The transmission packet received from the transmitter is intentionally lost based on the difference between the optimal packet loss rate given from the code parameter design unit and the naturally occurring packet loss rate, connected to the network. A coding rate controller for sending to the receiver via the network;
Have
The code parameter designer is
Check matrix generation means for generating a sparse check matrix row and column by listing and holding only non-zero positions of the matrix;
Decoding processing measurement means for obtaining a code length, a coding rate, a packet loss rate based on the check matrix, and outputting as a code characteristic;
Decoding performance evaluation means for determining a coding rate range based on the range of packet loss rates that can be covered by a given system and the code characteristics, and outputting the code length, together with the packet loss rate,
Estimating the decoding processing time from the coding rate range, the code length, and the packet loss rate using a model of the recovery processing time, and determining the optimum packet loss rate, the code length, and the coding rate as a code parameter And a decoding processing time model means for outputting as a data transmission system.

  According to one aspect, it is possible to perform transmission at an optimum coding rate while guaranteeing real-time transmission delay according to a dynamically changing network state. Also in the case of a transmission system having a plurality of network transmission paths, transmission can be performed so as to be optimal for the characteristics of each network.

It is an example of a structure of the transmission system in the 1st Embodiment of this invention. It is an example of the parity check matrix H in the first embodiment of the present invention. It is an example of the bipartite graph corresponding to FIG. 2 in the 1st Embodiment of this invention, and the reception condition of a packet. 3 is a data structure for implementing the computer of FIG. 2 in the first embodiment of the present invention. It is an example of a structure of the LDPC decoder in the 1st Embodiment of this invention. It is a flowchart of the decoding process in the 1st Embodiment of this invention. It is a structural example of the LDPC code parameter design device in the 1st Embodiment of this invention. It is a specific example of the LDPC code characteristic in the 1st Embodiment of this invention. 2 is a configuration example of a transmitter, a coding rate controller, and a receiver in the first embodiment of the present invention. It is a block diagram of the conventional video transmission system. It is a structural example of the video transmission system in the 2nd Embodiment of this invention. It is an example of the LDPC encoding process implemented with the conventional video transmission system. 13 is a packet structure including the LDPC header in FIG. It is a flowchart of operation | movement of the coding rate controller in the 2nd Embodiment of this invention. It is a structural example of the LDPC code packet reception memory of the video receiver in the 2nd Embodiment of this invention. It is a flowchart of operation | movement of the video receiver in the 2nd Embodiment of this invention. It is a structural example of the transmission system in the 3rd Embodiment of this invention. It is an example which produces | generates distributed data from one video data in the 3rd Embodiment of this invention. It is a structural example of the transmission system in the 4th Embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  The present invention solves the following problems.

  (1) Design the code length and coding rate of the LDPC code when the assumed range of packet loss rate on the network is determined and the allowable transmission time or the upper bandwidth limit of the network is determined (constraint conditions). .

  (2) Determining the amount of puncture (intentional packet loss) that maximizes the transmission efficiency when the packet loss rate on the network is known (constraint condition). Here, the constraint condition refers to a condition in which LDPC decoding is completed in the shortest time with a preset network available bandwidth or the network usage bandwidth is minimized with a preset fixed delay time.

  (3) To achieve the object even in a transmitter / receiver system using a conventional LDPC code having a puncturing function according to a packet loss rate on the network.

  (4) To achieve the object even in a multicast transmission system using a conventional LDPC code that does not have a puncturing function according to the packet loss rate on the network.

  (5) Contrary to the configuration of (4) above, a system for transmitting from a distributed storage and distributed transmitter having an LDPC code to a single receiver (transmitter: receiver = N: 1 system) ) To achieve the purpose. Here, there are N transmission paths, each of which has a different network packet loss rate, and includes the case where the puncture amount needs to be controlled independently.

[First Embodiment]
In this embodiment, a transmission method for controlling the coding rate of network transmission by puncturing LDPC codes will be described.

  FIG. 1 is a configuration example of a transmission system according to the first embodiment of the present invention.

  The transmission system shown in the figure includes a transmitter 30, a network 40, a receiver 50, an LDPC code parameter design unit 10, and a coding rate controller 20.

  The LDPC code parameter design unit 10 performs parameter design to minimize the LDPC decoding time based on the input check matrix. Since the LDPC code depends on the code length, the coding rate, and the number of lost packets, these parameters are set so that the recovery process is completed in the shortest time.

  The LDPC code is defined by a check matrix H. FIG. 2 shows an example of a parity check matrix. In this example, a regular LDPC code having a code length N = 10, a transmission information amount K = 5, a code parity number M = 5, a coding rate R = K / N = 0.5, and a column weight Dcol = 2. The LDPC code is also expressed as a bipartite graph as shown in FIG. Received symbols (referred to as packets in the present invention) are represented as variable nodes at the bottom, and each parity check equation is represented as an upper check node. The matrix representation of FIG. 2 and the graph representation of FIG. 3 show the same thing. The check node corresponds to a parity check equation. For example, the check node C1 in FIG. 3 indicates that the check equation “COL1 can be recovered by ROW1”. Similarly, the variable node at the bottom of FIG. Therefore, when the transmission process is completed in the transmission system, the reception status of each packet is assigned to the variable node.The reception status is “received” or “not received (erasure)”. Become either. In the actual process, the receiver determines a certain reception time, and assigns it as “reception” for a packet received within that time, and “disappears” otherwise. In an actual LDPC code, the code length N is set to be very large for a column weight Dcol of about 3. That is, the non-zero elements of the matrix are very sparse and most elements are zero.

  In implementing the decoding process of the LDPC code, it is required to efficiently express the sparse matrix described above. Therefore, instead of using a simple two-dimensional array as in the prior art, only non-zero positions are stored as a list in an LDPC encoder (not shown) and an LDPC decoder in the receiver 50 described later. It is possible to express a sparse matrix well. FIG. 4 shows an example of the check matrix of FIG. 2 expressed by this method.

This representation consists of a set of sparse check matrix rows and columns (set ROW and set COL), each of which is a list indicating a non-zero position in one row and column. The element of the set ROW is a vector of column numbers where “1” stands in each row of the check matrix H. For example, in FIG. 4, the elements of the set ROW are ROW1 to ROW5, and ROW1 represents the first row of the check matrix H (FIG. 2), and the first, fourth, seventh, and tenth columns. Since “1” is set to, the vector becomes ROW1 = (1,4,5,10). Since the set COL corresponds to one received packet, each element also holds a variable indicating the reception status. Specifically, a graph variable is prepared and recorded in the variable. For example, in C language,
struct COL {
int col_list []; // COL vector
int flag_recv: // COL reception status}
And so on. The above check matrix H is generated by an LDPC check matrix generation unit of the LDPC code parameter designer 10 described later, passed to the receiver 50, and held by the LDPC decoder 100 of the receiver 50 shown below.

  Next, an LDPC decoding process after receiving a packet including an erasure at the receiver 50 will be described. 5 and 6 show the LDPC decoding process of the present invention.

  The receiver 50 includes an LDPC decoder 100 as shown in FIG.

  The LDPC decoder 100 includes an initialization processing unit 110, a recovery scanning processing unit 120, a recovery COL queue 130, a recovery calculation processing unit 140, a received packet data memory 150, and an LDPC check matrix list expression storage unit 160. The LDPC parity check matrix list representation storage unit 160 holds the parity check matrix H generated by the LDPC code parameter designer 10 in a list format.

  As shown in FIG. 6, the LDPC decoding is processed by being divided into three parts: an initialization process, a recovery scanning process, and a recovery calculation process.

  First, the initialization processing unit 110 initializes the LDPC parity check matrix list representation storage unit 169, arranges the sparse matrix described above in the LDPC parity check matrix list representation storage unit 160, and reception status of received packets. (Step 101). The subsequent recovery scanning processing unit 120 finds a row element (check equation) that can be recovered from the set ROW corresponding to the set of parity check equations from the LDPC check matrix list expression storage unit 160 and registers it in the recovery COL queue 130. (Step 103, Yes, 104). Here, a recoverable row element refers to a row in which only one packet in the “lost” state is included in one row (that is, in the parity check equation). The recovery calculation processing unit 140 acquires the row element from the recovery COL queue 130, and changes the recoverable COL element state from “lost” to “received” (step 105). When there are no more row elements that can be recovered from the set ROW, the recovery scanning process is terminated (step 103, No). In the final recovery calculation process, the recovery calculation processing unit 140 performs an addition process on the received packet data based on the recovery COL queue 130 and stores the received packet data in the received packet data memory 150 (step 106). Note that the addition processing of the received packet data is XOR calculation (addition on GF (2)), so the addition and subtraction are the same.

A specific process of the LDPC decoding process will be described when the reception status is FIG. When the set ROW is scanned from the top, it is registered in the recovery COL queue 130 as follows.
・ COL1 can be recovered by ROW1:
・ COL3 can be recovered by ROW2:
・ COL5 can be recovered by ROW3:
・ COL9 can be recovered by ROW4:
Subsequently, the recovery calculation processing unit 140 recovers each lost packet based on the recovery COL queue 130 by the following additive calculation.
・ ROW1: COL1 = COL4 + COL7 + COL10:
・ ROW2: COL3 = COL2 + COL6 + COL7:
・ ROW3: COL5 = COL1 + COL6 + COL8:
・ ROW4: COL9 = COL2 + COL5 + COL10:
Thus, all lost packets are recovered by LDPC decoding.

  In this way, in FEC including LDPC decoding, it is possible to restore transmitted packets without receiving all packets. Therefore, if the packet loss rate on the network is known, the vicinity of the transmitter 30 In this case, it is possible to change the network transmission rate by intentionally causing packet loss.

  However, the time required for the LDPC decoding process varies depending on the LDPC code length N, coding rate R, column weight Dcol, and number of lost packets. For this reason, in a transmission system where real-time performance is important, parameter design is required to minimize the LDPC decoding time in a given network transmission band. In another situation, it is necessary to obtain a minimum network transmission band for a preset LDPC decoding time. In order to obtain this, in the present invention, this is realized by a transmission system using the LDPC code parameter design unit 10 as shown in FIG.

  The configuration of the LDPC code parameter design unit 10 is shown in FIG.

  The LDPC code parameter design unit 10 includes an LDPC check matrix generation unit 11, an LDPC decoding process measurement unit 12, an LDPC decoding performance evaluation unit 13, an LDPC decoding processing time model unit 14, and an LDPC code parameter optimization unit 15.

  The LDPC check matrix generation unit 11 generates a check matrix as shown in FIG. 2 that is sparse by listing and holding only non-zero positions of the matrix by the above method, and inputs the check matrix to the LDPC decoding processing measurement unit 12 To do.

The LDPC decoding process measurement unit 12 executes an LDPC decoding process when the packet loss rate _Pe is changed using the above-described LDPC decoding processing method on the LDPC check matrix given by the LDPC check matrix generation unit .

  The LDPC decoding performance evaluation unit 13 evaluates the code characteristics acquired from the LDPC decoding processing measurement unit 12. Specifically, FIG. 8 shows code characteristics when the coding rate R is changed at a code length N = 3000. Thereby, the characteristics of the packet loss rate versus the recovery success probability at the code length N and the coding rate R are experimentally obtained. In the present embodiment, random packet loss occurs, and an area having a recovery success probability of 1 in a calculation experiment with 100,000 trials is adopted as a parameter. Although the number of trials is 100,000 here, the number of iterations is sufficient for examining the code characteristics, and is not limited to 100,000. In the example of FIG. 8, when the range of the network packet loss rate is 0.43, the coding rate R = 0.5 or more is adopted. As described above, when the range of the packet loss rate covered by the system is given from the outside (for example, a user or a measurement device on the network), the LDPC decoding performance evaluation unit 13 performs LDPC decoding on the corresponding range of the coding rate R. Output to the processing time model unit 14.

Subsequently, when the LDPC code length N, coding rate R, and packet loss rate Pe are given, the LDPC decoding processing model unit 14 estimates the LDPC decoding processing time. First, the LDPC decoding processing time T _dec can be decomposed into an initialization processing time T _init , a recovery scanning processing time T _scan , and a recovery calculation processing time T _{xor as shown} in FIG.

T_initは疎行列である検査行列のデータを図４のような構造でメモリ（図示せず）に配置し、受信パケットに相当する列要素の受信状況を検査する処理にかかる時間である。したがって、この処理時間は符号長Ｎに線型増加する。よって、線型増加の係数をC_initとすると、

T _init is the time taken to process the check matrix data, which is a sparse matrix, in a memory (not shown) having the structure shown in FIG. 4 and check the reception status of the column elements corresponding to the received packets. Therefore, this processing time increases linearly to the code length N. Therefore, if the coefficient of linear increase is C _init ,

T_scanは消失したパケットのうちLDPC復号によって回復可能なパケットを走査する処理に関係し線型増加する。本発明では、すべての消失パケットが回復可能である符号特性領域を用いるため、パケット消失率がP_eである場合の操作される消失パケット数はP_e Nであるため線型増加の係数をC_scanとすれば、

_Tscan is related to the process of scanning lost packets that can be recovered by LDPC decoding, and increases linearly. In the present invention, since the use of all the codes characteristic area lost packet is recoverable, the coefficient of linear increase for operating the number of lost packets is P _e N when the packet loss rate is P _e C _scan given that,

T_xorは回復される消失パケット数およびパケットサイズL_pktに線型増加する。また、ひとつの消失パケットを回復する際の加法計算量は検査行列の行重みD_rowに比例する。用いるLDPC符号の検査行列がレギュラー符号（D_colが全ての列で同じ、かつ、D_rowが全ての行で同じである符号。図１の例は全ての行及び全ての列で"１"が立っている数が同じであるのでレギュラー符号となる）、もしくは、厳密に全ての行・列で"１"が立っている数（行重み・列重み）が同じでなくても、例えば、１００列のうち９９列が列重み３で、１列だけ列重みが２であるような場合（近似）には、行重みは列重みD_colによって表現でき、

T _xor increases linearly to the number of lost packets recovered and the packet size L _pkt . Also, the amount of addition calculation for recovering one lost packet is proportional to the row weight D _row of the parity check matrix. The parity check matrix of the LDPC code to be used is a regular code (D _col is the same in all columns, and D _row is the same in all rows. In the example of FIG. 1, "1" is in all rows and all columns. Even if the number of standing “1” s in all the rows / columns (row weight / column weight) is not the same (for example, 100) If 99 of the columns have a column weight of 3 and only one column has a column weight of 2 (approximate), the row weight can be expressed by the column weight D _col ,

よって、線型係数をC_xorとすれば、

Therefore, if the linear coefficient is C _xor ,

ここで、パケットサイズL_pktおよび列重みD_colを一定にしたLDPC符号を考えると、これらの定数をまとめて、以下のようになる。

Here, considering an LDPC code in which the packet size L _pkt and the column weight D _col are constant, these constants are summarized as follows.

以上より、LDPC復号に必要な処理時間T_decは下記のように表現できる。上記のLDPC復号処理のモデルにおいて、LDPC復号処理計測部１２による計測試行の結果から二乗誤差最小になる値を各線型増加の係数C_init、C_scan、C_xor'として用いる。

From the above, the processing time T _dec necessary for LDPC decoding can be expressed as follows. In the above-described LDPC decoding process model, the value that minimizes the square error from the result of the measurement trial by the LDPC decoding process measuring unit 12 is used as the coefficients C _init , C _scan , and C _xor ′ of each linear increase.

ここで、ネットワーク伝送速度をW、伝送データのサイズをSとすると、本発明の受信器５０において、伝送データを受信開始してからLDPC復号処理が完了するまでの処理時間T_recvは、

Here, assuming that the network transmission rate is W and the size of transmission data is S, the processing time T _recv from the start of reception of transmission data to the completion of LDPC decoding processing in the receiver 50 of the present invention is:

と表される。以上により、ネットワーク伝速度Wが一定における受信処理時間T_recvを最小にするLDPC符号パラメタを決定する場合には、

It is expressed. From the above, when determining the LDPC code parameter that minimizes the reception processing time T _recv when the network transmission speed W is constant,

なるPe, N, Rを決定する。また、受信処理時間T_recvが一定の場合にネットワーク伝速度Wを最小にする場合には、

Determine Pe, N, and R. Also, when the network transmission speed W is minimized when the reception processing time T _recv is constant,

となるP_e, N, Rを決定する。

P _e , N, and R are determined.

  Thus, a transmission system as shown in FIG. 1 is configured using the LDPC code parameters and the check matrix determined by the LDPC code parameter design unit 10.

  As illustrated in FIG. 9, the transmitter 30 includes an LDPC encoding unit 31, a storage unit 32, and a transmission unit 33. The LDPC encoding unit 31 of the transmitter 30 performs LDPC encoding on the input transmission data using the LDPC check matrix given from the LDPC code parameter design unit 10 and temporarily stores it in the storage unit 32. Thereafter, the transmission unit 33 transmits the data to the subsequent coding rate controller 20 at a constant transmission rate.

  As shown in FIG. 9, the coding rate control device 20 has a packet loss control unit 21. The packet loss control unit 21 determines the optimum packet loss rate given from the LDPC code parameter designer and the actual network. Considering the difference from the naturally occurring packet loss rate, the transmission packet sent from the transmitter 30 is lost intentionally.

  As shown in FIG. 9, the receiver 50 includes a receiving unit 51 and an LDPC decoding unit 52. The receiving unit 51 receives a transmission packet, and the LDPC decoding unit 52 performs lost packet recovery processing.

  Based on the above, the real-time decoding processing time, which was difficult in the past, is estimated, and the LDPC code decoding process is separated into initialization processing, recovery scanning processing, and recovery calculation processing. By formulating the relationship between the code rate, packet loss rate, and code length that contributes to time, the coefficient of the processing time is obtained once by measuring on the computer, and the arbitrary code rate, packet loss rate, code length It is possible to obtain the decoding time at.

[Second Embodiment]
In the present embodiment, an example in which the first embodiment is applied to a video transmission system will be described.

  FIG. 10 shows a configuration diagram of a conventional video transmission system.

  The video transmission system shown in the figure includes a compressed video data, a video transmitter 100 having an LDPC encoder 110, a network 300 having packet loss, a network measuring device 210 capable of measuring a packet loss rate on the network, and an LDPC decoder. The video receiver 200 includes an LDPC code reception memory 230.

Among these, the compressed video data, the video transmitter 100 including the LDPC encoder 110, and the video receiver 200 including the LDPC decoder 220 are used in a conventional transmission system as shown in FIG. In the conventional video transmission system, the maximum value of the packet packet loss state of the network is determined, and the LDPC coding is performed by statically setting the coding rate of the error correction code using LDPC that only covers it. Compensate for packet loss on the network. For this reason, the packet loss rate on the network changes with time, and the coding rate is constant even when there is almost no loss. Therefore, transmission of extra parity packets occurs and network efficiency is deteriorated.

  With the configuration shown in FIG. 11, the conventional video transmission system can be used as it is, and the coding rate can be changed based on the packet loss rate on the network, and transmission can be performed without reducing the network efficiency. Become. Thereby, the above-mentioned problem (3) can be solved.

  The coding rate controller 20 and the network measuring instrument 310 of the video transmission system shown in FIG. 11 are completely independent of the video transmitter 100 including the LDPC encoder 110 and the video receiver 200 including the LDPC decoder 220. Works.

  FIG. 12 shows LDPC encoding processing performed in a conventional video transmission system. The compressed video data to be transmitted is divided into fixed small packets (1280 bytes). One packet corresponds to one symbol of the LDPC code. After that, LDPC coding is performed using the code length and coding rate calculated based on the LDPC code design method described in the first embodiment, and a parity packet is generated. The size of the unit parity packet is equivalent to the video data packet packetized earlier. Next, an LDPC header (16 bytes) necessary for LDPC decoding is added to the video packet and the parity packet, and these packets are transmitted to the video receiver 200 by the UDP / IP method.

  FIG. 13 shows a transmitted packet structure including the LDPC header used here. The LDPC header is composed of an LDPC block number (4 bytes), an LDPC packet number (4 bytes), an LDPC code length (4 bytes), and the number of video data packets in the LDPC block (4 bytes). The LDPC block number is used to identify the LDPC block to which the packet belongs. For example, when network transmission delay and jitter are large, a packet belonging to another LDPC block may arrive, and this is necessary for processing without confusion. The packet number in the LDPC block is necessary for identifying the position of the packet in UDP / IP communication that does not guarantee the arrival and the order of the packet. LDPC code length and the number of video data packets in an LDPC block are used to identify whether the packet is a packet containing video data or a packet containing parity data when a single packet is viewed. Is necessary.

FIG. 14 shows an intentional packet discarding method implemented by the coding rate controller 20 in the present embodiment. First, the coding rate controller 20 acquires the packet loss rate _Perr occurring on the current network from the network measuring device 310 (step 201). Subsequently, to obtain the network packet loss rate P _e of the expected range by a user operation (step 202). From these pieces of information, an intentional packet loss rate P _d generated by the coding rate controller 20 is obtained (step 203). P _d is for packet loss rate at the time reaching the image receiver 200 is generated intentional packet loss such that P _e, is determined as follows.

(1-P _e ) = (1-P _d ) (1-P _err )
P _d = 1-(1-P _e ) / (1-P _err )
Subsequently, after waiting for reception of a UDP packet (step 204), UDP reception is performed (step 205). If the packet is a target packet (step 206, Yes), a random number is generated, and the destination is determined according to the random number. to reject the incoming packet with a probability P _d determined (step 207).

  FIG. 15 shows the configuration of the LDPC code packet reception memory 230 in the video receiver 200. The reception LDPC code packet memory 230 includes a data area of a size that can store all video data packets and parity packets, and an area for recording the reception status of each packet. In the initialization process, all reception statuses are set to “not received” and all data areas are set to zero values. When a video data packet or a parity packet arrives, the IP header, UDP header, and LDPC header are removed and stored in the location of the LDPC code packet reception memory 230 corresponding to the packet number in the LDPC block in the LDPC header. Thereafter, the reception state is changed from “not received” to “received”.

  FIG. 16 shows a reception process in the video receiver 200.

  The video receiver 200 secures the LDPC code packet reception memory 230 and performs initialization (step 301). Next, a timed timer for the reception time is started. This time timer generates an interrupt when the time is up (step 302). The timed timer value is set to a time at which the LDPC decoding time calculated in the first embodiment is regarded as an actual decoding process and the decoding process is completed by the video playback time. The following processing is repeated until an interrupt occurs in the above timed timer.

  The video receiver 200 receives a UDP packet after waiting for reception of a UDP packet (step 303) (step 304). With reference to the LDPC block number of the LDPC header of the received packet, it is confirmed whether it is currently being received (step 305). If the packet is not currently being received (step 305, No), the packet is ignored and the process returns to waiting for UDP packet reception again (proceeds to step 303). If the packet is currently being received (step 305, Yes), the packet number in the LDPC block is referred to, and only the payload portion of the packet is stored in the area of the LDPC code packet reception memory 230 corresponding to the number (step 306). ). Subsequently, the reception status at the same position is changed from “not received” to “received” (step 307).

  When an interruption by the reception timed timer occurs, the place of “not received” in the reception status of the LDPC code reception memory 230 is changed to “erasure” (step 308). Thereafter, the LDPC decoding process is started (step 309).

  As described above, the LDPC decoding process is performed in the video receiver 200 including the LDPC decoder 220, and the original video data is completely reproduced. In the video receiver 200 including the LDPC decoder 220, even when a coding rate controller is inserted between the video transmitter and the video receiver as in the present embodiment, the same as the conventional system. Can be handled by the LDPC decoding process.

[Third embodiment]
FIG. 17 shows a configuration example of a transmission system in the third embodiment of the present invention.

In the present embodiment, N (N is 1 or more) distributed storage data, transmitters 30 ₁ to 30 _N , coding rate controllers 20 _{1 to} 20 _N , network measuring devices 310 _{1 to} 310 _N , and LDPC The receiver 200 includes a decoder 220.

In the present embodiment, distributed storage data and its transmitters 30 ₁ to 30 _N are distributed to reduce the processing load on each of the transmitters 30 ₁ to 30 _N , and the network to the receiver 200 is also independent. Therefore, the network load can be reduced.

A means for generating distributed storage data from one video data is shown in FIG. Here, as an example, the case where the distributed storage number N = 3 is shown. Similarly to each second embodiment, each of the transmitters 30 ₁ to 30 _N divides the video data into packets and then LDPC-codes them to generate parity packets. An LDPC header is added to the video data packet and the parity packet obtained here. The LDPC header used here is the same as that used in the second embodiment. Subsequently, the video data packet and the parity packet are sequentially assigned to the distributed storage host from the top. Similarly, parity packets are assigned to the distributed storage hosts in order from the top. Thus, when all the video data packets and parity packets are allocated, the video data packets and parity packets in each storage host are equalized. The video data to be transmitted is stored and arranged in a distributed manner as described above.

  The transmission process and reception process of this embodiment will be described.

When a transmission request for video data is transmitted from the receiver 200 including the LDPC decoder 220 to all the transmitters 30, each of the transmitters 30 ₁ to 30 _N is distributed and stored in the receiver 200. Start transmitting the video data. Each transmitter ₃₀ 1 to 30 _N and the encoding rate controller ₂₀ 1 to 20 intermediate the inserted arrangement of receivers 200 _N and the network measuring unit ₃₁₀ 1 to 310 _N, the same operation as the second embodiment Thus, intentional packet discard according to the packet loss rate occurring in the network is performed, and the coding rate is controlled. The receiver 200 including the LDPC decoder 220 performs reception processing and LDPC decoding processing of video data packets and parity packets received by the same means as in the second embodiment.

As described above, it is possible to receive video data transmitted from a plurality of transmitters 30 ₁ to 30 _N arranged in a distributed manner at a coding rate according to the packet loss rate of each network, and to perform LDPC decoding. It becomes possible.

  According to the present embodiment, the above-mentioned problem (5) can be solved.

[Fourth Embodiment]
FIG. 19 shows a configuration example of a transmission system in the fourth embodiment of the present invention.

The transmission system shown in the figure includes video data, a transmitter 100 having an LDPC encoder 110, a multicast router 400, a plurality of encoding controllers 20 _{1 to} 20 _N , a plurality of network measuring instruments 310 _{1 to} 310 _N , and The receivers 200 ₁ to 200 _N each include a plurality of LDPC decoders 220. In this system, when the same video data is transmitted to a plurality of receivers 200 ₁ to 200 _N using multicast, it is transmitted at a coding rate corresponding to the network packet loss rate of each network (each multicast path).

  In the transmitter 100 having the LDPC encoder 110, video data packetization, parity packet generation by LDPC encoding, and LDPC header addition are performed using the same means as in the second embodiment. Thereafter, the transmitter 100 including the LDPC encoder 110 transmits these video data packets and parity packets to the multicast router 400.

When receiving the multicast join request from the receiver 200 or the lower router, the multicast router 400 copies the packet toward the receiver 200 or the lower router. In FIG. 19, the receiver 200 directly belongs to the multicast router 400. The copied packet finally reaches the receiver 200 including the LDPC decoder 220 through each network path. In this embodiment, the coding rate controller 20 and the network measuring device 310 are inserted between the multicast router 400 and the receiver 200. Thus, the same processing as the second embodiment, the control of the coding rate corresponding to the network packet loss rate in each coding rate controller 20 ₁ to 20 _N is applied, comprises a LDPC decoder 220 Multicast packets are transmitted to the receivers 200 ₁ to 200 _N to be received.

In receivers 200 ₁ to 200 _N each including LDPC decoder 220, LDPC decoding processing is performed by the same means as in the second embodiment, and the transmitted video data is restored. In the present embodiment, since the transmitter 100 and all the receivers 200 ₁ to 200 _N may use a single LDPC code, the implementation and management are simplified. In addition, even when the packet loss rate changes for each network, highly efficient network transmission is realized without changing any operation of the transmitter and receiver.

  According to the present embodiment, the above problem (4) can be solved.

  Although the first to fourth embodiments have been described using the LDPC code, the present invention is not limited to the LDPC code and can be applied to an error correction code.

  The present invention is not limited to the above-described embodiment, and various modifications and applications can be made within the scope of the claims.

10 LDPC code parameter design unit 11 LDPC check matrix generation unit 12 LDPC decoding process measurement unit 13 LDPC decoding performance evaluation unit 14 LDPC decoding processing time model unit 15 LDPC code parameter optimization unit 20 coding rate controller 21 packet erasure control unit 30 Transmitter 31 LDPC encoder 32 Storage unit 33 Transmitter 40 Network 50 Receiver 51 Receiver 52 LDPC decoder 100 LDPC decoder 110 Initialization processor 120 Recovery scan processor 130 Recovery COL queue 140 Recovery calculation processor 150 Received packet Data memory 160 LDPC check matrix list expression storage unit 200 Video receiver 210 Network measuring instrument 220 LDPC decoder 230 LDPC code packet reception memory 300 Network (with packet loss)
310 Network Instrument 400 Multicast Router

Claims (7)

A data transmission system for obtaining an optimum transmission rate for a network packet loss rate using an error correction code,
A transmitter that encodes transmission data using a check matrix and transmits transmission packets at a predetermined rate;
A receiver connected to a network, including a decoding means for receiving a transmission packet and performing recovery processing of a lost packet;
Based on the input check matrix, a parameter design for minimizing the decoding time of the transmission data of the receiver, and a code parameter design unit for outputting an optimal packet loss rate,
The transmission packet received from the transmitter is intentionally lost based on the difference between the optimal packet loss rate given from the code parameter design unit and the naturally occurring packet loss rate, connected to the network. A coding rate controller for sending to the receiver via the network;
Have
The code parameter designer is
Check matrix generation means for generating a sparse check matrix row and column by listing and holding only non-zero positions of the matrix;
Decoding processing measurement means for obtaining a code length, a coding rate, a packet loss rate based on the check matrix, and outputting as a code characteristic;
Decoding performance evaluation means for determining a coding rate range based on the range of packet loss rates that can be covered by a given system and the code characteristics, and outputting the code length, together with the packet loss rate,
Estimating the decoding processing time from the coding rate range, the code length, and the packet loss rate using a model of the recovery processing time, and determining the optimum packet loss rate, the code length, and the coding rate as a code parameter Decoding processing time model means for outputting as:
A data transmission system comprising: The code parameter designer is
The data transmission system according to claim 1, wherein the data transmission system is provided in the transmitter or on a network. A data transmission system for multicast distribution of video data ,
A transmitter having an encoder for a transfer transmission data is encoded, it transmits a transmission packet,
A plurality of receivers including decoding means for receiving transmission packets and performing lost packet recovery processing;
A multicast router that duplicates the transmission packet and transmits it to a plurality of receivers or lower routers;
A plurality of encoding rate controller wherein acquires the transmission packet from the multicast router, rejecting said transmission packet obtained was collected,
A plurality of network measuring devices that send transmission packets acquired from the coding rate controller to the receiver, measure the loss rate of packets occurring on the current network, and output to the coding rate controller When,
I have a,
The encoder generates a sparse check matrix row and column by holding only non-zero positions of the matrix in a list, and from the code length, coding rate, and packet loss rate based on the check matrix A code length that minimizes a decoding time obtained by estimating a decoding processing time using a model of a recovery processing time, and means for encoding at a coding rate,
The coding rate controller includes means for rejecting the transmission packet based on a difference between a packet loss rate obtained based on the check matrix and a loss rate of the transmission packet generated on the current network. <br/> A data transmission system characterized by the above. The decoding means of the receiver is
An initialization processing means for placing a sparse matrix in a memory and checking the reception status of a packet;
And recovering the scanning means for storing in finding recovery queue the packet or al-healing processable row elements,
Recovery calculation means for obtaining a recoverable row element from the recovery queue, performing an additive process on the data of the packet, and decoding the lost packet;
The data transmission system according to claim 1 or 3, comprising: A data transmission method for obtaining an optimum transmission rate for a packet loss rate of a network using an error correction code,
In a system having a transmitter, a receiver, a code parameter design unit, and a code rate controller,
A transmission packet sending step in which the transmitter encodes transmission data using a check matrix and sends out transmission packets at a predetermined rate;
The code parameter design unit performs a parameter design for minimizing the decoding time of transmission data of the receiver based on the input check matrix, and outputs an optimal packet erasure rate; and
The encoding rate controller is deliberately stochastically abolished the transmission packet received from the transmitter based on a difference between the optimal packet loss rate and naturally occurring packet loss rate, said over the network A coding rate control step to be sent to the receiver;
A decoding step in which the receiver receives the transmission packet and performs recovery processing of a lost packet;
And
In the sign parameter design step,
A check matrix generation step for generating a sparse check matrix row and column by listing and holding only non-zero positions of the matrix;
Decoding process measurement step for obtaining the code length, coding rate, packet loss rate based on the parity check matrix, and outputting as a code characteristic;
Decoding performance evaluation step for obtaining a range of coding rate based on the range of packet loss rate that can be covered by a given system and the code characteristics, and outputting together with the code length and the packet loss rate;
Estimating the decoding processing time from the coding rate range, the code length, and the packet loss rate using a model of the recovery processing time, and determining the optimum packet loss rate, the code length, and the coding rate as a code parameter Decoding processing time model step to output as
A data transmission method comprising: A data transmission method for multicast distribution of video data,
In a system having a transmitter, a multicast router, a plurality of coding rate controllers, a plurality of network measuring instruments, and a plurality of receivers,
Encoder in the transmitter, the transfer transmission data by encoding the transmit step you sent the transmission packet,
A transmission step in which the multicast router duplicates the transmission packet and transmits it to a plurality of receivers or lower routers;
Each of the encoding rate controller acquires the transmission packet from the multicast router, and a coding rate control step for rejecting obtained was said transmission packets collected,
Each of the network measuring instruments sends the acquired transmission packet to the receiver at the subsequent stage, measures the loss rate of the packet generated on the current network, and outputs it to the coding rate controller at the preceding stage Network measurement steps,
A decoding step in which each of the receivers receives a transmission packet from a network instrument in the previous stage and performs recovery processing of a lost packet;
The stomach line,
In the transmission step,
A sparse check matrix row and column are generated by holding only the non-zero positions of the matrix as a list, and a recovery processing time model from the code length, coding rate, and packet loss rate based on the check matrix Is encoded with a code length and coding rate that minimize the decoding time obtained by estimating the decoding processing time using
In the coding rate control step,
The data transmission characterized in that the transmission packet is rejected based on a difference between a packet loss rate obtained based on the check matrix and a loss rate of the transmission packet generated on the current network. Method. In the decoding step,
An initialization process step that places a sparse matrix in memory and checks the reception status of packets;
And recovering scanning storing it finds restore queue the packet or al-healing processable row elements,
A recovery calculation step of obtaining a recoverable row element from the recovery queue, performing an additive process on the data of the packet, and decoding a lost packet;
The data transmission method according to claim 5 or 6, comprising:

Images