Technique of Error Concealment for Block-Based Image Coding Using Genetic Algorithm

Since real world communication channels are not error free, the coded data transmitted on them may be corrupted, and block based image coding systems are vulnerable to transmission impairment. So the best neighborhood match method using genetic algorithm is used to conceal the error blocks. Experimental results show that the searching space can be greatly reduced by using genetic algorithm compared with exhaustive searching method, and good image quality is achieved. The peak signal noise ratios(PSNRs) of the restored images are increased greatly.

BLOCK CODING SCHEME FOR REDUCING PAPR IN OFDM SYSTEMS WITH LARGE NUMBER OF SUBCARRIERS

The major drawback in Orthogonal Frequency Division Multiplexing (OFDM) system is due to the high Peak-to-Average Power Ratio (PAPR), so the performance of the system is significantly degraded by the nonlinearity of a High Power Amplifier (HPA) in the transmitter.In order to mitigate distortion, a block coding scheme for reducing PAPR in OFDM systems with large number of subcarriers based on complementary sequences and predistortion is proposed,which is capable of both error correction and PAPR reduction. Computer simulation results show that the proposed scheme significantly improves Bit Error Rate(BER) performance as compared to an uncoded system when an HPA is employed or a coded system without predistortion.

Performance Enhancement of Multiuser Passive Time Reversal Communication Based on Space-Time Block Coding

Reliable, with high data rate, acoustic communication in time-valTing, multipath shallow water environment is a hot research topic recently. Passive time reversal communication has shown promising results in improvement of the system performance. In multiuser environment, the system performance is significantly degraded due to the interference among different users. Passive time reversal can reduce such interference by minimizing the cross-correlated version of channel impulse response among users, which can be realized by the well-separated users in depth. But this method also has its shortcomings, even with the absence of relative motion, the minimization sometimes may be impossible because of the time-varying environment. Therefore in order to avoid the limitation of minimizing the cross-correlated channel function, an approach of passive time reversal based on space-time block coding （STBC） is presented in this paper. In addition, a single channel equalizer is used as a pest processing technique to reduce the residual symbol interference. Experimental results at 13 kHz with 2 kHz bandwidth demonstrate that this method has better performance to decrease bit error rate and improve signal to noise ratio, compared with passive time reversal alone or passive time reversal combined with equalization.

A HIGH-PERFORMANCE VLSI ARCHITECTURE OF EBCOT BLOCK CODING IN JPEG2000

The paper presents a new architecture composed of bit plane-parallel coder for Embedded Block Coding with Optimized Truncation (EBCOT) entropy encoder used in JPEG2000. In the architecture, the coding information of each bit plane can be obtained simultaneously and processed parallel. Compared with other architectures, it has advantages of high parallelism, and no waste clock cycles for a single point. The experimental results show that it reduces the processing time about 86% than that of bit plane sequential scheme. A Field Programmable Gate Array (FPGA) prototype chip is designed and simulation results show that it can process 512×512 gray-scaled images with more than 30 frames per second at 52MHz.

Fractal Block Coding:A New Method

Fractal image compression is a completely new method to compress images by searching and exploiting the self similarity of the whole image . Fractal Block Coding (FBC) is a practicable fractal coding scheme with annoying slow encoding speed . In this paper, we classify the image blocks by Classified Vector Quantization (CVQ) technique and present an Adaptive Block Truncation Coding (ABTC) scheme to process the midrange blocks in the image. By this method , we reduce the encoding time to one forty fifth comparing to ordinary FBC method with little change in compression ratio and a little decreased coded image quality.

Improved scheme with cooperative diversity based on distributed space-time block coding

An improved scheme with cooperative diversity based on distributed space-time block coding （WCD- DSTBC） is proposed, which effectively achieves diversity gains and improves the performance of the system by sharing some single-antenna users＇ antennas to form a virtual antenna array and combining with distributed spacetime block coding （DSTBC） mode. Then the relation between the system BER and the interuser BER for WCDDSTBC scheme is theoretically derived and the closed-form expression of BER for WCD-DSTBC system is obtained. The simulation results show that the proposed WCD-DSTBC scheme achieves distinct gains over the non-cooperative multi-carrier CDMA （MC-CDMA） system. When system BER is le-3 and interuser BER is le-3, about 2.5 dB gain can be gotten. When interuser channel state information （CSI） outgoes the users＇ individual CSI, about 3 dB gain is also achieved.

Efficient spread space-time block coding scheme in multiple antenna systems

Space-time coding is an important technique that can improve transmission performance at fading environments in mobile communication systems. In this paper, we propose a novel diversity scheme using spread spacetime block coding （SSTBC） in multiple antenna systems. At the transmitter, the primitive data are serial to parallel converted to multiple data streams, and each stream is rotated in constellation. Then Walsh codes are used to spread each symbol to all antenna space in a space-time block. The signals received from all receiver antennas are combined with the maximum ratio combining （MRC）, equalized with linear equalizer to eliminate the inter-code interference and finally demodulated to recover to transmit data by using the one-symbol maximum likelihood detector. The proposed scheme does not sacrifice the spectrum efficiency meanwhile maintains the transceiver with low complexity. Owing to the transmission symbols of different transmit antennas passing through all the spatial subchannels between transceiver antenna pairs, the system obtains the partial additional space diversity gain of all spatial paths. It is also shown that the diversity gain is better than the previous space-time block coding （STBC） schemes with full transmission rate.

Adaptive Decoding Algorithm Based on Multiplicity of Candidate Sequences for Block Turbo Codes

It is known that Block Turbo Codes （BTC） can be nearly optimally decoded by Chase-II algorithm, in which the Least Reliable Bits （LRBs） are chosen empirically to keep the size of the test patterns （sequences） relatively small and to reduce the decoding complexity. While there are also other adaptive techniques, where the decoder＇s LRBs adapt to the external parameter of the decoder like SNR （Signal Noise Ratio） level, a novel adaptive algorithm for BTC based on the statistics of an internal variable of the decoder itself is proposed in this paper. Different from the previous reported results, it collects the statistics of the multiplicity of the candidate sequences, i.e., the number of the same candidate sequences with the same minimum squared Euclidean distance resulted from the decoding of test sequences. It is shown by Monte Carlo simulations that the proposed adaptive algorithm has only about 0.02dB coding loss but the average complexity of the proposed algorithm is about 42% less compared with Pyndiah＇s iterative decoding algorithm using the fixed LRBs parameter.

COMPLEMENT BLOCK CODING SCHEME FOR REDUCING PEAK-TO-AVERAGE POWER RATIO OF OFDM SYSTEMS

A new scheme termed as Complement Block Coding (CBC) technique is proposed to reduce the Peak-to-Average Power Ratio (PAPR) of OFDM signals. Utilizing the complement bits which are added to the original information bits,this method can effectively reduce the PAPR of OFDM systems with random frame size N and the coding rate R ≤ (N - k)/N, where kis a positive integer and k ≤ N/2. The performance results obtained with CBC are given and compared with that of some well known schemes, such as Simple Block Coding (SBC), Modified Simple Block Coding (MSBC) and Simple Odd Parity Code (SOPC) for the same purpose. The results show that, at the same coding rate 3/4, the CBC can achieve almost the same performance as SBC, MSBC, but with lower complexity, and that the same performance can be obtained with higher coding rate by using CBC. At the same coding rate (N - 1)/N, the PAPR reduction of CBC is almost the twice as that of SOPC when N ≥ 16. Further more, the PAPR reductions with coding rate (N - 1)/N are almost the same as that with coding rate less than (N - 1)/N,so the proposed scheme CBC is more suitable for the large frame size with high coding rate and can provide error detection.

Closed Loop Space-Time Block Coding for Wireless Downlink Transmission

In order to improve the poor performance of Space-Time Block Coding (STBC) in a downlink correlated fading environment, a closed loop scheme is proposed. With the known channel fading statistics fed from the receiver, eigenbeamforming is utilized to improve the performance of STBC at the transmitter. The new system achieves the array and diversity gain simultaneously. Because reduced dimension processing is adopted, the proposed system has a relative simple structure compared with the traditional beamforming system. The validity of the scheme is verified in several situations by simulation experiments.

Single bitmap block truncation coding of color images using hill climbing algorithm

In order to generate an efficient common bitmap in single bitmap block truncation coding(SBBTC)of color images,an improved SBBTC scheme based on weighted plane(W-plane)method and hill climbing algorithm is proposed.Firstly,the incoming color image is partitioned into non-overlapping blocks and each block is encoded using the W-plane method to get an initial common bitmap and quantization values.Then,the hill climbing algorithm is applied to optimize an initial common bitmap and generate a near-optimized common bitmap.Finally,the quantization values are recalculated by the near-optimized common bitmap and the considered color image is reconstructed block by block through the common bitmap and the new quantization values.Since the processing of each image block in SBBTC is independent and identical,parallel computing is applied to reduce the time consumption of this scheme.The simulation results show that the proposed scheme has better visual quality and time consumption than those of the reference SBBTC schemes.

OPTIMAL ANTENNA SUBSET SELECTION AND BLIND DETECTION APPROACH APPLIED TO ORTHOGONAL SPACE-TIME BLOCK CODING

An approach combining optimal antenna subset selection with blind detection scheme for Orthogonal Space-Time Block Coding (OSTBC) is proposed in this paper. The optimal antenna sub- set selection is taken into account at transmitter and/or receiver sides, which chooses the optimal an- tennas to increase the diversity order of OSTBC and improve further its performance. In order to en- hance the robustness of the detection used in the conventional OSTBC scheme, a blind detection scheme based on Independent Component Analysis (ICA) is exploited which can directly extract transmitted signals without channel estimation. Performance analysis shows that the proposed ap- proach can achieve the full diversity and the flexibility of system design by using the antenna selec-tion and the ICA based blind detection schemes.

UNIT-RATE COMPLEX ORTHOGONAL SPACE-TIME BLOCK CODE CONCATENATED WITH TURBO CODING

Space-Time Block (STB) code has been an effective transmit diversity technique for combating fading due to its orthogonal design, simple decoding and high diversity gains. In this paper, a unit-rate complex orthogonal STB code for multiple antennas in Time Division Duplex (TDD) mode is proposed. Meanwhile, Turbo Coding (TC) is employed to improve the performance of proposed STB code further by utilizing its good ability to combat the burst error of fading channel. Compared with full-diversity multiple antennas STB codes, the proposed code can implement unit rate and partial diversity; and it has much smaller computational complexity under the same system throughput. Moreover, the application of TC can effectively make up for the performance loss due to partial diversity. Simulation results show that on the condition of same system throughput and concatenation of TC, the proposed code has lower Bit Error Rate (BER) than those full-diversity codes.

Low complexity suboptimal decode algorithms for quasi- orthogonal space time block codes

Due to the high complexity of the pairwise decoding algorithm and the poor performance of zero forcing（ ZF） /minimum mean square error（ MMSE） decoding algorithm, two low-complexity suboptimal decoding algorithms, called pairwisequasi-ZF and pairwise-quasi-MMSE decoders, are proposed. First,two transmit signals are detected by the quasi-ZF or the quasiMMSE algorithm at the receiver. Then, the two detected signals as the decoding results are substituted into the two pairwise decoding algorithm expressions to detect the other two transmit signals. The bit error rate（ BER） performance of the proposed algorithms is compared with that of the current known decoding algorithms.Also, the number of calculations of ZF, MMSE, quasi-ZF and quasi-MMSE algorithms is compared with each other. Simulation results showthat the BER performance of the proposed algorithms is substantially improved in comparison to the quasi-ZF and quasiMMSE algorithms. The BER performance of the pairwise-quasiZF（ pairwise-quasi-MMSE） decoder is equivalent to the pairwiseZF（ pairwise-MMSE） decoder, while the computational complexity is significantly reduced.

Performance of STBC-MC-CDMA system based on complex wavelet packet and turbo coding

On the basis of analyzing the principle of the space-time coding technique and the multi-carrier code division multiple access （MC-CDMA） technique, adopting the turbo codes as channel coding and the optimized complex wavelet packet as multi-carrier modulation, a novel space-time block coded the MC-CDMA system based on complex wavelet packet and turbo coding is proposed, and the system bit error rate （BER） performance in the Rayleigh fading channel is investigated. The system can make full use of space-time block codes＇ transmit diversity and turbo codes＇ good ability against fading channel to improve the BER performance significantly, and it can also avoid the decrease of spectrum efficiency of conventional MC-CDMA due to inserting cyclic prefix （CP） by utilizing superior characteristics of the optimized complex wavelet packet. Simulation results show that the proposed space-time block coded MC-CDMA system based on the complex wavelet packet performs better than the conventional space-time block coded MC-CDMA （STBC-MC-CDMA） system, and slightly outperforms the STBC-MC-CDMA with CP. Moreover, the application of the space-time block coding technique concatenated with turbo codes strengthens the system ability to combat various interferences in fading channel further.

A Method for Improving Power Distribution Characteristics of Space Time Block Codes

Improving power distribution characteristics of space time block codes(STBCs),namely peak to average power ratio(PAPR),average to minimum power ratio(Ave/min),and probability of transmitting"zero"by antenna,makes easier their practical implementation.To this end,this study proposes to multiply full diversity STB C with a non-singular matrix in multiple input multiple output(MIMO)or multiple input single output(MISO)systems with linear or maximum likelihood(ML)receivers.It is proved that the obtained code achieves full diversity and the order of detection complexity does not change.The proposed method is applied to different types of STBCs.The bit error rate(BER)and power distribution characteristics of the new codes demonstrate the superiority of the introduced method.Further,lower and upper bounds on the BER of the obtained STBCs are derived for all receivers.The proposed method provides trade-off among PAPR,spectral efficiency,energy efficiency,and BER.

An Improved Group Space-Time Block Code Through Constellation Rotation

A new improved group space-time block code (G-STBC) based on constellation rotation for four transmit antennas was proposed. In comparison with the traditional G-STBC coding scheme, the proposed space-time code has longer code length and adopts proper rotation-based symbols, which can increase the minimum distance of space-time codes and thereby improve code gain and achieve full diversity performance. The simulation results verify that the proposed group space-time code can achieve better bit error performance than both the traditional group space-time code and other quasi-orthogonal space-time codes. Compared with Ma’s full diversity full rate (FDFR) codes, the proposed space-time code also can achieve the same excellent error performance. Furthermore, the design of the new space-time code gives another new and simple method to construct space-time codes with full diversity and high rate in case that it is not easy to design the traditional FDFR space-time codes.

Performance of MIMO Systems Using Space Time Block Codes (STBC)

Digital Communications, in relation to wireless networks, have taken off in recent years due to the expanding need to communicate faster and more efficiently. A popular way to achieve this is by using wireless Multiple Input Multiple Output (MIMO) communication systems. MIMO systems utilize Space Time Block Codes (STBC) as one of the leading ways to obtain higher data rates with limited bandwidth and power. With several STBC methods currently available, this paper analyzes simulations using Orthogonal Space Time Block Codes (OSTBC) in Rayleigh fading channels to evaluate the performance of MIMO systems. The selection to use a Rayleigh fading channel as a model for a non-line-of-sight (nLOS) environment is selected to mimic installations where a large number of signal paths and reflections are expected. All simulations are coded, generated and plotted using MATLAB resulting in graphical data representing the bit-error rate (BER) to signal-to-noise ratio (Eb/N0) or SNR. Each simulation captures how different configurations of key variables including code rate, diversity and antenna count can impact system performance. Four modulation schemes (BPSK, QPSK, 16-QAM and 64-QAM) are included in each simulation. Conclusive evidence based upon these simulations suggests higher diversity gains were achieved with a greater number of antennas. The most significant factor for increasing system performance was using a lower count of transmit antennas with a higher count of receive antennas.

Optimal and suboptimal structured algorithms of binary linear block codes

The optimal and suboptimal structured algorithms of linear block codes from the geometrical perspective are represented.The minimum distance and weight property lemmas and the theorem are proved for the generator matrix.Based upon the property of generator matrix,the structured algorithms of linear block codes are demonstrated.Since the complexity of optimal structured algorithm is very high,the binary linear block codes is searched by using the suboptimal structured algorithm.The comparison with Bose-Chaudhuri-Hocquenqhem（BCH） codes shows that the searched linear block codes are equivalent on minimum distance and can be designed for more block lengths.Because the linear block codes are used widely in communication systems and digital applications,the optimal and suboptimal structured algorithms must have great future being widely used in many applications and perspectives.

Joint channel estimation and symbol detection for space-time block code

The simplified joint channel estimation and symbol detection based on the EM (expectation-maximization) algorithm for space-time block code (STBC) are proposed. By assuming channel to be invariant within only one STBC word and utilizing the orthogonal structure of STBC, the computational complexity and cost of this algorithm are both very low, so it is very suitable to implementation in real systems.