Space-frequency transmit diversity (SFTD) and space-code transmit diversity (SCTD), which are both based on space-time block codes (STBC), were applied to time-direction spreading and two-dimensional spreading orthogonal frequency-division multiplexing code-division multiplexing (OFDM-CDM) systems, and the transmission performances were compared by computer simulation. SFTD is designed for space and two adjacent subcarriers whereas SCTD is designed for space and two distinct Walsh-Hadamard (WH) codes. The simulation results show that SCTD applied to time-direction spreading OFDM-CDM was superior to SFTD because frequency selectivity distorted STBC's orthogonality between sub-carriers in SFTD. In contrast, when they were applied to two-dimensional spreading OFDM-CDM, SFTD was superior to SCTD when the number of WH codes belonging to the same mother-code group is small because the frequency diversity provided by SFTD surpassed that provided by SCTD. In addition, both SFTD and SCTD provide high tolerance to large Doppler spread. It can be therefore concluded that both SCTD and SFTD can be used in the same frame by code-multiplexing according to their suitability to physical channels. SCTD is suitable for transmitting high-rate data via time-direction spreading, whereas SFTD is suitable for transmitting control data via two-dimensional spreading.

A multi-user space-time block coding (STBCa) system is a multi-access system where co-channel users employ space-time block codes (STBC). In this paper, we aimed at the design of efficient zero-forcing (ZF) receivers, especially ZF iterative interference cancellation (IC) receivers, for multi-user {G2, G3, G4} STBC systems with an arbitrary number of users, based on the identification of algebraic properties existing in the systems. First, we identify some algebraic properties for {G2, G3, G4} STBC systems. Then, utilizing these algebraic properties, we further expose two significative properties, called "ZF output uncorrelated property" and "ZF output equal Post-detection SNR property" respectively, for least-squares (LS) ZF receivers in multi-user {G2, G3, G4} STBC systems by detailed proofs. Based on the two properties, a novel LS ZF user-ordered successive interference cancellation (ZF UOSIC) detection algorithm is proposed subsequently. Finally, simulation results show that ZF UOSIC is superior to the conventional ZF IC and maximum-likelihood (ML) algorithms and the non-ordered ZF user-based SIC (ZF USIC) algorithm due to adopting iterative IC and optimal ordering among users, and has very close performance to the ZF symbol-ordered SIC but with lower complexity due to the fewer iterative times.

Recently, a number of techniques have been introduced to exploit multiuser diversity of a wireless multiple-input multiple-output (MIMO) broadcast channel (BC) that consists of a base station with t transmit antennas and K users with multiple antennas. However, prior works have ignored the rate overhead associated with feedback of MIMO BC channel state information at transmitter (CSIT), which is roughly K times larger than single-user MIMO CSIT (i.e., it is O(tr) where r = rk and rk is the number of antennas at the kth user). Considering the amount of feedback signaling, quantization is a necessity for effective feedback transmission as a form of partial CSIT. In this paper, we propose the greedy multi-channel selection diversity (greedy MCSD) scheme based on block MMSE QR decomposition with dirty paper coding (block MMSE-DP), where partial CSIT is almost sufficient. The sum-rate performance of our novel scheme approaches extremely close to the sum capacity of MIMO BC as the number of users increases, whereas the feedback overhead is reduced by a factor of 2t3/L(t2-t), in which L is the number of active channel vectors. Simulation results validate the expectation from the analysis. In addition, the proposed scheme is shown to be appropriate for reconfigurable implementation.

Performance of the minimum mean square error (MMSE) detection is far below that of the maximum likelihood (ML) detection in a multiuser environment and decreases significantly as the number of co-channel users increases. In this paper, we propose a combined MMSE and ML multiuser detection scheme for space-time block coded (STBC) orthogonal frequency division multiplexing (STBC-OFDM) which has improved performance but with low complexity. In particular, we propose a reduced complexity ML post-detection (ML-PDP) scheme which can correct erroneously estimated bits from the outputs of MMSE multiuser detection. The proposed ML-PDP scheme performs sequential search to detect a predefined number of bits with higher probability of error and then uses ML detection to correct them. Upon controlling the number of corrected bits it is possible to balance the system performance with complexity associated with the ML-PDP. We show that significant improvement can be achieved at the cost of only small additional complexity compared with the MMSE multiuser detection.

In this manuscript, a layered macro/micro diversity scheme is introduced at the receiver side of a MIMO STBC wireless control system under fading and shadowing environment. The combination of the outputs of micro diversity is based on soft-decision values, while the macro diversity branches are combined based on hard decision values. As a measure of the reliability of the system, the outage probability of frame-error rate is employed. The performance of the proposed system is analytically and numerically evaluated and the impact of the macro diversity in the outage probability is clarified.

In this paper, we evaluate the effect of space-time coded cooperative relaying technique in multihop inter-vehicle communication (IVC) networks. The IVC systems have an issue that communication links are often blocked by obstacles such as heavy vehicles. The breakage of a radio link in multihop connections may significantly decrease the system throughput in multihop IVC networks. It is demonstrated through system-level evaluations that the cooperative relaying can offer remarkable capacity enhancement by exploiting multi-route diversity and overcoming accidental link breakage resulting from frequent topological changes.

In this letter, we propose a simplified step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri- Hocquenghem (BCH) codes based on logical analysis. Compared to the conventional step-by-step decoding algorithm, the computation complexity of this decoder is much less, since it significantly reduces the matrix calculation and the operations of multiplication.

Orthogonal modulation provides low probability of bit error, however its bandwidth efficiency is very low. Biorthogonal code may double the bandwidth efficiency, but its required bandwidth grows exponentially with the number of input bits as in orthogonal modulation. In this paper, we propose a multi-code biorthogonal code keying (MBCK) scheme that significantly reduces the signal bandwidth with the benefit from orthogonal waveform coding maintained. The system consists of multiple waveform coding blocks, and the sum of output codewords is transmitted. A problem with MBCK is that output signal is multi-level, which requires amplifier with high linearity. So it may not be an appropriate scheme for portable unit where power efficiency is highly important. We also propose a modified MBCK scheme that guarantees constant amplitude output. The transmitter of the proposed scheme contains a redundant waveform coder whose input is generated by encoding the information bits. Adding the codewords from all constituent waveform coding blocks, the composite signal has constant amplitude. It is also shown that the redundant bits are not only used to make constant amplitude signal but also used to improve the BER performance at the receiver.

In the adaptive modulation and coding (AMC)-based orthogonal frequency division multiple access (OFDMA) system for broadband wireless service, a large number of users with short packets cause a serious capacity mismatch problem, which incurs resource under-utilization when the data rate of subchannel increases with a better channel condition. To handle the capacity mismatch problem, we propose an AMC-based subchannel multiplexing (ASM) scheme, which allows for sharing the same subchannel among the different simultaneous flows of the same user. Along with the ASM scheme, we also consider multi-class scheduling scheme, which employs the different packet scheduling algorithm for the different service class, e.g., packet loss rate-based (PLR) scheduling algorithm for real-time (RT) service and modified minimum bit rate-based (MMBR) scheduling algorithm for non-real-time (NRT) service. In the typical integrated service scenario with voice, video, and data traffic, we have shown that the proposed schemes significantly improve the overall system capacity.

The history of forward error correction in optical communications is reviewed. The various types of FEC are classified as belonging to three generations. The first generation FEC represents the first to be successful in submarine systems, when the use of RS(255, 239) became widespread as ITU-T G.975, and also as G.709 for terrestrial systems. As WDM systems matured, a quest began for a stronger second generation FEC. Several types of concatenated code were proposed for this, and were installed in commercial systems. The advent of third-generation FEC opened up new vistas for the next generation of optical communication systems. Thanks to soft decision decoding and block turbo codes, a net coding gain of 10.1 dB has been demonstrated experimentally. That brought us a number of positive impacts on existing systems. Each new generation of FEC was compared in terms of the ultimate coding gain. The Shannon limit was discussed for hard or soft decision decoding. Several functionalities employing the FEC framing were introduced, such as overall wrapping by the FEC frame enabling the asynchronous multiplexing of different clients' data. Fast polarization scrambling with FEC was effective in mitigating polarization mode dispersion, and the error monitor function proved useful for the adaptive equalization of both chromatic dispersion and PMD.

A low-complexity step-by-step decoding algorithm for t-error-correcting binary Bose-Chaudhuri-Hocquenghem (BCH) codes is proposed. Using logical analysis, we obtained a simple rule which can directly determine whether a bit in the received word is correct. The computational complexity of this decoder is less than the conventional step-by-step decoding algorithm, since it reduces at least half of the matrix computations and the most complex element in the conventional step-by-step decoder is the "matrix-computing" element.

We propose a multiple-subcarrier (MS) optical communication system using intensity modulation with direct detection (IM/DD) with peak reduction carriers (PRCs) to improve the power efficiency of IM/DD MS systems. The proposed system transmits L subcarriers referred to as PRCs among N subcarriers for the d.c. bias reduction so that the optical power is reduced. Since information bits are mapped onto each subcarrier other than PRCs independently, the information bits of each subcarrier can be detected independently and the error rate of the proposed system is unaffected by PRCs.

A high accuracy numerical technique based on the Finite Difference Time Domain (FDTD) method for a long dipole antenna analysis is presented. An improvement of the accuracy can be achieved without reducing the cell size by incorporating a quasi-static field behavior into the FDTD update equations. A closed form of the quasi-static field is obtained from a low frequency limit of a sinusoidal current distribution. The validity of the proposed algorithm is confirmed even when the length of dipole antenna is longer than half wavelength by comparing the results with the Method of Moment.

The combination of OFDM and multiple antennas in either the transmitter or receiver is attractive to increase a diversity gain. However, multiple antennas system requires an antenna separation of 5-10 λ to keep the correlation coefficient below 0.7 for the space diversity, so this may be difficult to implement in a mobile station with high mobility. Recently, the polarization transmit diversity is considered in a mobile station. However, polarization transmit diversity requires twice transmit powers to compare with the conventional transmit diversity, since only vertically polar antenna cannot receive the horizontal signal components. In this paper, we express the cross correlation of each polarization antenna and the cross polarization discrimination (XPD) of multiple polarization antennas with simple model, and we propose an wideband OFDM using Alamouti coded heterogeneous polarization antennas for reducing the previous problem. From the simulated results, the proposed system shows better BER performance than that of the conventional STBC/OFDM.

For future high-speed wireless communications using orthogonal frequency division multiplexing (OFDM), two major system requirements will emerge: throughput improvement and rich interference elimination. Because of its broadband nature and limited frequency allocations worldwide, interference from co-located wireless LAN's operating in the same frequency band will become a serious deployment issue. Adaptive array antenna can enhance the performance by suppressing the co-channel interference even when interference may have a large amount of multipath and also have similar received power to the desired signal. There are typically two types of adaptive array architecture for OFDM systems, whose signal processing is carried out before or after FFT (Fast Fourier Transform). In general, the pre-FFT array processing has low complexity, but in rich multipath and interference environments, the performance will deteriorate drastically. In contrast, the post-FFT array processing can provide the optimum performance even in such severe environments at the cost of complexity. Therefore, complexity-reduction techniques combined with the achievement of high system performance will be a key issue for adaptive array antenna applications. This paper proposes novel adaptive array architecture, which is a complexity-reduction technique using subcarrier clustering for post-FFT adaptive array. In the proposed scheme, plural subcarriers can be clustered into a group with the same spatial weight. Simulation results show that the proposed architecture is a promising candidate for real implementation, since it can achieve high performance with much lower complexity even in a rich multipath environment with low signal to noise plus interference ratio (SNIR).

Recently, Space-Time Block Coded OFDM (ST-OFDM) that applies Space-Time Block Code (STBC) to OFDM has been proposed. Space-Frequency Block Coded OFDM (SF-OFDM) has been also proposed where the block codes are formed over the space and frequency domain. ST-OFDM and SF-OFDM are known as the schemes that achieve good performance over the multipath fading environments and the fast fading environments, respectively. For the systems with two transmit antennas, the orthogonal conditions required to separate the received signals are that in ST-OFDM, the frequency responses of the consecutive two OFDM symbols are almost identical and that in SF-OFDM, the frequency responses of the adjacent two subcarriers are almost identical. In practical fading environments, however, these conditions of the orthogonality sometimes cannot be satisfied. In those environments, the received signals cannot be well separated and the performances are degraded. Recently, the diagonalized maximum likelihood decoder (DMLD) of new zero-forcing (ZF) type was proposed for the space-time block coded single carrier QPSK system to maintain the orthogonality of STBC under the fast fading environments and the flat fading environments, where the channel separation in DMLD is performed by the ZF algorithm using two receive signals at time index 2n, 2n+1 (Space Time Code: STC) or two subcarriers (Space Frequency Code: SFC). Note that the matrix generated after the channel separation is not an identity matrix but the matrix proportional to an identity matrix. We show that ST/SF-OFDM with DMLD outperform ST/SF-OFDM in terms of Bit Error Rate (BER).

Space-time block coded orthogonal frequency division multiplexing (ST-OFDM) has been proposed as an attractive solution for a high bit rate data transmission in a multipath fading environment. Space-frequency block coded OFDM (SF-OFDM) has been also proposed as another solution. These two systems utilize STBC with a 22 transmission matrix, using two transmit antennas. In ST-OFDM the block codes are formed over the space-time domains. In SF-OFDM the block codes are formed over the space-frequency domains. If we apply STBC with a 44 transmission matrix to OFDM, using four transmit antennas, we can expect the performance improvement. However, when the block codes are formed over space-time (frequency) domains with four transmit antennas, the conditions of the orthogonality become more strict. We can expect that if the block codes are formed over space-time-frequency domains with four transmit antennas, that is, if we implement space-time-frequency block coded OFDM (STF-OFDM), the condition of the orthogonality is more relaxed. In this paper, we apply STBC with a 44 transmission matrix to OFDM and propose STF-OFDM. We evaluate the performance of the three types of systems (ST-OFDM, SF-OFDM, STF-OFDM). We show that the best system with respect to the error rate performance differs in the different channel conditions. When the effect of the Doppler spread is large and the effect of the delay spread is small, SF-OFDM has the best error rate performance, and STF-OFDM and ST-OFDM follow in order. When the effect of the delay spread is large and the effect of the Doppler spread is small, ST-OFDM has the best error rate performance, and STF-OFDM and SF-OFDM follow in order. We also show that STF-OFDM is attractive in wireless communications. STF-OFDM is more tolerant than ST-OFDM with respect to the Doppler spread and SF-OFDM with respect to the delay spread, respectively.

In many parallel programs, run-time data redistribution is usually required to enhance data locality and reduce remote memory access on the distributed memory multicomputers. Research on data redistribution algorithms has recently matured. The time required to generate data sets and processor sets is much lesser than before. Therefore, packing/unpacking has become a relatively high cost in redistribution. In this paper, we present methods to perform BLOCK-CYCLIC(s) to BLOCK-CYCLIC(t) redistribution, using MPI user-defined datatypes. This method reduces the required memory buffers and avoids unnecessary movement of data. Theoretical models are presented to determine the best method for redistribution. The methods were implemented on an IBM SP2 parallel machine to evaluate the performance of the proposed methods. The experimental results indicate that this approach can clearly improve the redistribution in most cases.

A good channel assignment scheme in a multihop ad hoc network should not only guarantee successful data transmissions without collisions, but also enhance the channel spatial reuse to maximize the system throughput. It becomes very inefficient to use fixed channel assignment when the network size grows. Therefore, spatial reuse of channels become more important in a large multihop ad hoc network. In this paper, we consider an ad hoc network with an overlaid CDMA/TDMA structure. We divide each code into time slots to form the channels. A dynamic channel assignment (DCA) strategies called Greedy-Based DCA (GB-DCA) is proposed in a clustered wireless multihop ad hoc network. This DCA strategy is designed to make better use of available channels by taking advantage of the spatial reuse concept. In GB-DCA, the increase in spatial reuse is achieved by adding certain control overhead. We show that the bandwidth saving due to channel spatial reuse is higher than the additional bandwidth spent on the control overhead.

In this letter, we investigate a decimated selective mapping (SLM) method for the peak-to-mean envelope power ratio (PMEPR) reduction in an OFDM system. Under the condition of the same side information (SI) bits, the SLM can be implemented by decimating OFDM samples, which is less complex compared to the ordinary SLM incurring a slight degradation of the PMEPR performance. The decimated SLM (DSLM) approach can be generalized to a multiple-antenna OFDM system employing a space-time block coding (STBC).