In this paper, a critical analysis of the joint source channel coding scheme proposed by Honary et al.1 is given. We show mathematically that although the algorithm leads to a reduction in the overall number of decoding states it increases both the time and space complexity of the decoding ...
he operation analysis found that the construct static huffman tree, a large number of time consumed in the two smallest elements selected from the set of elements. Dynamic huffman coding algorithm overcome the shortcomings of the former, but the complexity of the algorithm, and decompression time....
Pulkki V., “Spatial Sound Reproduction with Directional Audio Coding,” Journal of the Audio Engineering Society, Jun. 2007, vol. 55 (6), pp. 503-516. Rafaely, “Spatial alignment of acoustic sources based on spherical harmonics radiation analysis,” 4th International Symposium on Communicatio...
This realizes the time variability of compression coding stream (CCS) of an image in that the image TV-HCT has large change space. Analysis shows that the average change space of TV-HCT in UCID is 3.97脳10327, and the average ER of three databases is more than 0.44 bpp higher than the...
In this paper, a critical analysis of the joint source channel coding scheme proposed by Honary et al. is given. We show mathematically that although the algorithm leads to a reduction in the overall number of decoding states it increases both the time and space complexity of the decoding ...
performance analysissignal processing for communicationsThis paper addresses the optimization problem of minimizing the distortion subject to a rate constraint for an MPEG-4 Advanced Audio Coding (AAC) encoder. We first develop a mathematical model of the AAC encoding process. In previous work, the ...
As the size of the block increases, the variant-Huffman coding approaches the entropy limit. However, there are some theoretical difficulties. For instance, first, the time complexity of the algorithm becomes exponential with regard to the size of the block, which makes the approach impractical. ...
Then, Huffman coding is used to compress the tag map so that a large amount of vacant space is obtained. Finally, the secret data can be embedded into the vacated space by directly using bit substitution. Compared with some recently reported methods, experimental results and analysis have ...