252 research outputs found

    A Turbo-Detection Aided Serially Concatenated MPEG-4/TCM Videophone Transceiver

    No full text
    A Turbo-detection aided serially concatenated inner Trellis Coded Modulation (TCM) scheme is combined with four different outer codes, namely with a Reversible Variable Length Code (RVLC), a Non-Systematic Convolutional (NSC) code a Recursive Systematic Convolutional (RSC) code or a Low Density Parity Check (LDPC) code. These four outer constituent codes are comparatively studied in the context of an MPEG4 videophone transceiver. These serially concatenated schemes are also compared to a stand-alone LDPC coded MPEG4 videophone system at the same effective overall coding rate. The performance of the proposed schemes is evaluated when communicating over uncorrelated Rayleigh fading channels. It was found that the serially concatenated TCM-NSC scheme was the most attractive one in terms of coding gain and decoding complexity among all the schemes considered in the context of the MPEG4 videophone transceiver. By contrast, the serially concatenated TCM-RSC scheme was found to attain the highest iteration gain among the schemes considered

    Optimal packetisation of MPEG-4 using RTP over mobile networks

    Get PDF
    The introduction of third-generation wireless networks should result in real-time mobile video communications becoming a reality. Delivery of such video is likely to be facilitated by the realtime transport protocol (RTP). Careful packetisation of the video data is necessary to ensure the optimal trade-off between channel utilisation and error robustness. Theoretical analyses for two basic schemes of MPEG-4 data encapsulation within RTP packets are presented. Simulations over a GPRS (general packet radio service) network are used to validate the analysis of the most efficient scheme. Finally, a motion adaptive system for deriving MPEG-4 video packet sizes is presented. Further simulations demonstrate the benefits of the adaptive system

    Turbo-Detected Unequal Protection MPEG-4 Wireless Video Telephony using Multi-Level Coding, Trellis Coded Modulation and Space-Time Trellis Coding

    No full text
    Most multimedia source signals are capable of tolerating lossy, rather than lossless delivery to the human eye, ear and other human sensors. The corresponding lossy and preferably low-delay multimedia source codecs however exhibit unequal error sensitivity, which is not the case for Shannon’s ideal entropy codec. This paper proposes a jointly optimised turbo transceiver design capable of providing unequal error protection for MPEG-4 coding aided wireless video telephony. The transceiver investigated consists of space-time trellis coding (STTC) invoked for the sake of mitigating the effects of fading, in addition to bandwidth efficient trellis coded modulation or bit-interleaved coded modulation, combined with a multi-level coding scheme employing either two different-rate non-systematic convolutional codes (NSCs) or two recursive systematic convolutional codes for yielding a twin-class unequal-protection. A single-class protection based benchmark scheme combining STTC and NSC is used for comparison with the unequal-protection scheme advocated. The video performance of the various schemes is evaluated when communicating over uncorrelated Rayleigh fading channels. It was found that the proposed scheme requires about 2.8 dBs lower transmit power than the benchmark scheme in the context of the MPEG-4 videophone transceiver at a similar decoding complexity

    Video Streaming in Evolving Networks under Fuzzy Logic Control

    Get PDF

    Performance and Complexity Co-Evaluations of MPEG4-ALS Compression Standard for Low-Latency Music Compression

    Get PDF
    In this thesis compression ratio and latency of different classical audio music tracks are analyzed with various encoder options of MPEG4ALS. Different tracks of audio music tracks are tested with MPEG4-ALS coder with different options to find the optimum values for various parameters to obtain maximum compression ratio with minimum CPU time (encoder and decoder time). Optimum frame length for which the compression ratio saturates for music audio is found out by analyzing the results when different classical music tracks are experimented with various frame lengths. Also music tracks with varying sampling rate are tested and the compression ratio and latency relationship with sampling rate are analyzed and plotted. It is found that the compression gain rate was higher when the codec complexity is less, and joint channel correlation and long term correlations are not significant and latency trade off make the more complex codec options unsuitable for applications where latency is critical. When the two entropy coding options, Rice code and BGMC (Block Gilbert-Moore Codes) are applied on various classical music tracks, it was obvious that the Rice code is more suitable for low-latency applications compared to the more complex BGMC coding, as BGMC improved compression performance with the expense of latency, making it unsuitable in real-time applications

    Watermarking on Compressed Image: A New Perspective

    Get PDF

    Irregular Variable Length Coding

    Get PDF
    In this thesis, we introduce Irregular Variable Length Coding (IrVLC) and investigate its applications, characteristics and performance in the context of digital multimedia broadcast telecommunications. During IrVLC encoding, the multimedia signal is represented using a sequence of concatenated binary codewords. These are selected from a codebook, comprising a number of codewords, which, in turn, comprise various numbers of bits. However, during IrVLC encoding, the multimedia signal is decomposed into particular fractions, each of which is represented using a different codebook. This is in contrast to regular Variable Length Coding (VLC), in which the entire multimedia signal is encoded using the same codebook. The application of IrVLCs to joint source and channel coding is investigated in the context of a video transmission scheme. Our novel video codec represents the video signal using tessellations of Variable-Dimension Vector Quantisation (VDVQ) tiles. These are selected from a codebook, comprising a number of tiles having various dimensions. The selected tessellation of VDVQ tiles is signalled using a corresponding sequence of concatenated codewords from a Variable Length Error Correction (VLEC) codebook. This VLEC codebook represents a specific joint source and channel coding case of VLCs, which facilitates both compression and error correction. However, during video encoding, only particular combinations of the VDVQ tiles will perfectly tessellate, owing to their various dimensions. As a result, only particular sub-sets of the VDVQ codebook and, hence, of the VLEC codebook may be employed to convey particular fractions of the video signal. Therefore, our novel video codec can be said to employ IrVLCs. The employment of IrVLCs to facilitate Unequal Error Protection (UEP) is also demonstrated. This may be applied when various fractions of the source signal have different error sensitivities, as is typical in audio, speech, image and video signals, for example. Here, different VLEC codebooks having appropriately selected error correction capabilities may be employed to encode the particular fractions of the source signal. This approach may be expected to yield a higher reconstruction quality than equal protection in cases where the various fractions of the source signal have different error sensitivities. Finally, this thesis investigates the application of IrVLCs to near-capacity operation using EXtrinsic Information Transfer (EXIT) chart analysis. Here, a number of component VLEC codebooks having different inverted EXIT functions are employed to encode particular fractions of the source symbol frame. We show that the composite inverted IrVLC EXIT function may be obtained as a weighted average of the inverted component VLC EXIT functions. Additionally, EXIT chart matching is employed to shape the inverted IrVLC EXIT function to match the EXIT function of a serially concatenated inner channel code, creating a narrow but still open EXIT chart tunnel. In this way, iterative decoding convergence to an infinitesimally low probability of error is facilitated at near-capacity channel SNRs
    corecore