No abstract

Fractal image compression (FIC) is a very popular technique in image compression applications due to its simplicity and superior performance. However, it has a major drawback, which is the long encoding time. This is due to the requirement of performing huge similarity search for encoding each small portion in the image. Thus, reducing the search time of FIC while keeping the quality of reconstructed images at acceptable level is still an active research topic. Therefore, this paper has focused on studying the search problem of the conventional full-search FIC algorithm and the impact of employing a spatial dynamic search technique instead with the matching threshold strategy. Unlike the conventional full-search method that is a spatially static where the search starts from a fixed position (normally from the top-left corner of the image to the bottom-right corner) regardless of the position of the range block being encoding, the idea of the dynamic search method is simple, but effective, and it is based on starting the search from the closest domain block to the range block that needs to be encoded. These two search schemes are tested under different matching threshold values, in which the search is terminated whenever a domain block with an acceptable matching level is found. To make the study comprehensive, the test is performed for different image sizes and types, range block and partitioning step sizes, and quantization levels. The experimental results show the significant impact of using the dynamic search method instead of the conventional search method specifically when the threshold is large. For the best encoding parameters, the improvement amount that can be achieved is near to 90 % in terms of search reduction and 1.6 dB PSNR in terms of image quality. INDEX TERMS Fractal image compression, fast search method, full search scheme.

No abstract

The bi-orthogonal codes for embedding Side-Information (SI) in data-based blind SLM (BSLM) proposed in Joo et al. (2012) produce better bit error rate (BER) and SI error rate (SIER) performance compared to binary codes. However, the authors do not provide details for code generation; instead, they list some codes with a length of / and a minimum Hamming distance of / . The suggested bi-orthogonal code does not work for any value of the maximum iteration number other than = ⌈ / ⌉. Therefore, this paper proposes two algorithms for generating codes for any value of . The proposed methods maintain the normalized minimum Hamming distance between generated codes to . . However, the second proposed algorithm, which works in the case of < ⌊ ⌋, is also able to only consider codes with a maximum Hamming distance, allowing it to improve SIER performance. Thus, the second proposed algorithm improves SIER performance by up to 1 dB at Eb/No=3dB. Furthermore, the proposed algorithms are able to generate a multiple set of codes that deliver same performance.

ABSTRACT:Orthogonal frequency division multiplexing (OFDM) is a well-known transmission technique that is adopted in a wide range of standards these days mainly because of its high data bit rate and spectral efficiency. However, OFDM has one major problem called the peak-to-average power ratio (PAPR). This paper will introduce a new method that uses the discrete cosine transform to enhance the PAPR reduction over that achieved in the partial transmit sequence (PTS) approach. The maximum achieved improvement of PAPR reduction compared to the conventional PTS approach is 257% with only 4 iterations and the maximum PAPR reduction achieved in the simulation is 5.7 dB.