A new method to recover packet losses using (2,1,m) convolutional codes is proposed. The erasure correcting decoding algorithm and the decoding determinant theorem is presented. It is also proved that the codes with o...A new method to recover packet losses using (2,1,m) convolutional codes is proposed. The erasure correcting decoding algorithm and the decoding determinant theorem is presented. It is also proved that the codes with optimal distance profile have also optimal delay characteristic. Simulation results show that the proposed method can recover the packet losses more elliciently than RS codes over different decoding delay conditions and thus suits for different packet network delav conditions.展开更多
Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive white Gaussian noise channel.In addition,he proved that there exists channel code that can theoretically achieve the cha...Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive white Gaussian noise channel.In addition,he proved that there exists channel code that can theoretically achieve the channel capacity.Indeed fortunately,the latter researchers found some practical channel codes approaching the channel capacity with insignificant losses of spectral efficiency under ignorable bit error rate(BER).The authors note,in general,that bits of the channel codes are not independent of each other in code space.Further,we note that the modulated symbols are not independent among them,as well,in Euclidean Space.By exploiting a usage of the dependencies jointly to signal design,we can transmit two independent signal streams through an additive white Gaussian channel and separate them in Euclidean space at the receiver.The capacity of this approach is found larger than that of Shannon capacity in the same channel assumptions.The numerical results confirm the theoretical procedures.展开更多
基金Supported by National Natural Science Foundation of China under Grant No.69896246
文摘A new method to recover packet losses using (2,1,m) convolutional codes is proposed. The erasure correcting decoding algorithm and the decoding determinant theorem is presented. It is also proved that the codes with optimal distance profile have also optimal delay characteristic. Simulation results show that the proposed method can recover the packet losses more elliciently than RS codes over different decoding delay conditions and thus suits for different packet network delav conditions.
基金supported by two Programs of National Natural Science Foundation of China(No.61271203 and No.61531004)
文摘Shannon channel capacity theorem poses highest bit-rate of error free transmission over additive white Gaussian noise channel.In addition,he proved that there exists channel code that can theoretically achieve the channel capacity.Indeed fortunately,the latter researchers found some practical channel codes approaching the channel capacity with insignificant losses of spectral efficiency under ignorable bit error rate(BER).The authors note,in general,that bits of the channel codes are not independent of each other in code space.Further,we note that the modulated symbols are not independent among them,as well,in Euclidean Space.By exploiting a usage of the dependencies jointly to signal design,we can transmit two independent signal streams through an additive white Gaussian channel and separate them in Euclidean space at the receiver.The capacity of this approach is found larger than that of Shannon capacity in the same channel assumptions.The numerical results confirm the theoretical procedures.
