This letter introduces a blind minimum interference symbol synchronization for orthogonal frequency-division multiplexing (OFDM) systems based on the cyclic prefix (CP). The basic idea of our contribution is to obtain an estimate of the channel-tap powers from the correlation characteristics of the CP. Based on the estimate of the channel-tap powers, a minimum interference metric is proposed. The proposed algorithm has low complexity and can be used to cope with long inter-symbol-interference (ISI) channels with length up to twice the CP length.
Kentaro NISHIMORI Takefumi HIRAGURI Masakatsu OGAWA Naoki HONMA
This paper proposes a new Ad-Hoc network system which comprises the multiple relay access points (APs) with multi channels. Ad-Hoc network systems are recently proposed and incorporated for the communication infrastructure, which relays wireless transmission among access points (APs) in wireless LAN (WLAN) system. System throughput is decreased due to hidden terminal problem when only a single channel is used for the Ad-Hoc network. In order to solve this problem, a new system with multi channels is proposed. However, even if the multi channels are employed, the co- and/or adjacent-channel interference occurs due to hidden terminal problem and multiple APs in a limited space, when considering a simultaneous transmit and reception at the relay AP. In this paper, we develop an Ad-Hoc network testbed which can reduce and avoid co- and/or adjacent-channel interference by using vertically arranged antenna configuration and distributed channel allocation scheme. Moreover, the effectiveness of our testbed is clarified by applying actual WLAN signals.
Xin NIE Jianhua ZHANG Ping ZHANG
Relay, which promises to enhance the performance of future communication networks, is one of the most promising techniques for IMT-Advanced systems. In this paper, multiple-input multiple-output (MIMO) relay channels based on outdoor measurements are investigated. We focus on the link between the base station (BS) and the relay station (RS) as well as the link between the RS and the mobile station (MS). First of all, the channels were measured employing a real-time channel sounder in IMT-Advanced frequency band (2.35 GHz with 50 MHz bandwidth). Then, the parameters of multipath components (MPCs) are extracted utilizing space-alternating generalized expectation algorithm. MPC parameters of the two links are statistically analyzed and compared. The polarization and spatial statistics are gotten. The trends of power azimuth spectrum (PAS) and cross-polarization discrimination (XPD) with the separation between the RS and the MS are investigated. Based on the PAS, the propagation mechanisms of line-of-sight and non-line-of-sight scenarios are analyzed. Furthermore, an approximate closed-form expression of channel correlation is derived. The impacts of PAS and XPD on the channel correlation are studied. Finally, some guidelines for the antenna configurations of the BS, the RS and the MS are presented. The results reveal the different characteristics of relay channels and provide the basis for the practical deployment of relay systems.
Ian Dexter GARCIA Kei SAKAGUCHI Kiyomichi ARAKI
A Gaussian MIMO broadcast channel (GMBC) models the MIMO transmission of Gaussian signals from a transmitter to one or more receivers. Its capacity region and different precoding schemes for it have been well investigated, especially for the case wherein there are only transmit power constraints. In this paper, a special case of GMBC is investigated, wherein receive power constraints are also included. By imposing receive power constraints, the model, called protected GMBC (PGMBC), can be applied to certain scenarios in spatial spectrum sharing, secretive communications, mesh networks and base station cooperation. The sum capacity, capacity region, and application examples for the PGMBC are discussed in this paper. Sub-optimum precoding algorithms are also proposed for the PGMBC, where standard user precoding techniques are performed over a BC with a modified channel, which we refer to as the "protection-implied BC." In the protection-implied BC, the receiver protection constraints have been implied in the channel, which means that by satisfying the transmit power constraints on the protection implied channel, receiver protection constraints are guaranteed to be met. Any standard single-user or multi-user MIMO precoding scheme may then be performed on the protection-implied channel. When SINR-matching duality-based precoding is applied on the protection-implied channel, sum-capacity under full protection constraints (zero receive power), and near-sum-capacity under partial protection constraints (limited non-zero receive power) are achieved, and were verified by simulations.
Eunju LEE Jaedon PARK Giwan YOON
In this paper, we analyze the performance of the 21 Alamouti scheme suggested by Alamouti, composed of the transmit space-time code and the simple linear decoding processing, in perfectly time-varying and spatially correlated channels. We derive the closed-form probability density function (PDF) of output signal-to-noise ratio (SNR) and outage probability of the Alamouti scheme as a function of spatial correlation coefficient in the consideration of no correlation in time. We observe that the performance of the Alamouti scheme is severely degraded when the channels are time-varying and spatially correlated.
Liang ZHU Yukui PEI Ning GE Jianhua LU
We propose a time-frequency interleave (TFI) structure of single carrier (SC) frequency domain equalization (FDE) to combat spectral nulls of wireless channels. Permuted copies of block data are transmitted in the TFI-FDE, providing the same diversity order as maximal-ratio receiver combining. The spectral nulls are compensated by uncorrelated spectral components of the same channel. It shows 4 dB diversity gains at BER of 10-2 over an indoor channel. The TFI-FDE is computationally-efficient in combination with fast Fourier transform. This TFI-FDE fits SC systems with single antenna. It needs no channel state information at the transmitter.
Bin SHENG Pengcheng ZHU Xiaohu YOU Lan CHEN
In this letter, we propose a low-complexity sparse channel estimation method for orthogonal frequency division multiplexing (OFDM) systems. The proposed method uses a discrete Fourier transform (DFT)-based technique for channel estimation and a novel sorted noise space discrimination technique to estimate the channel length and tap positions. Simulation results demonstrate that the reduction in signal space improves the channel estimation performance.
Soo Han CHOI Young Hee PARK Chul Hong PARK Sang Hoon LEE Moon Hyun YOO Jun Dong CHO Gyu Tae KIM
With the process scaling, the leakage current reduction has been the primary design concerns in a nanometer-era VLSI circuit. In this paper, we propose a new lithography process-aware edge effects correction method to reduce the leakage current in the shallow trench isolation (STI). We construct the various test structures to model Ileakage and Ileakage_fringe which represent the leakage currents at the center and edge of the transistor, respectively. The layout near the active edge is modified using the look-up table generated by the calibrated analytic model. On average, the proposed edge effects correction method reduces the leakage current by 18% with the negligible decrease of the drive current at sub-40nm DRAM device.
In-Ho LEE Joong-Hoo PARK Dongwoo KIM
In this letter, the outage performance of multi-hop multiple-input multiple-output (MIMO) relaying systems is analyzed for spatially correlated Rayleigh fading channels. We focus on nonregenerative MIMO decouple-and-forward (DCF) relaying in orthogonal space-time block code (OSTBC) transmission and provide its outage probability given the assumption of ideal relay gain. The outage obtained here is shown a lower bound for using practical gains, which gets tight at high SNR. We conduct numerical studies to assess the impact of the spatial correlation between antennas on the outage probability.
In this paper, we consider the error performance of the regular triangular quadrature amplitude modulation (TQAM). In particular, using an accurate exponential bound of the complementary error function, we derive a simple approximation for the average symbol error rate (SER) of TQAM over Additive White Gaussian Noise (AWGN) and fading channels. The accuracy of our approach is verified by some simulation results.
Bin SHENG Pengcheng ZHU Xiaohu YOU Lan CHEN
In this letter, we propose a novel sparse channel estimation method for orthogonal frequency division multiplexing (OFDM) systems. The proposed method uses a discrete Fourier transform (DFT)-based technique for channel estimation and a sorted generalized Akaike information criterion (GAIC) to estimate the channel length and tap positions. Simulation results demonstrate that an improved channel estimation performance is obtained due to the reduction of signal space.
Srijidtra MAHAPAKULCHAI Chalie CHAROENLARPNOPPARUT
In the modern day, MPEG-4 image compression technique have been commonly applied in various indoor wireless communication systems. The efficient system design mostly relies on the joint source channel coding algorithms, which aim to reduce the complexity of channel coding process, while maintaining the quality of the receiving images. In this paper, we design the MAP source-controlled channel decoders with both random and semirandom interleavers for Rician slow flat block-fading channels. The MAP-Viterbi decoder employs the residual redundancy from zerotree symbol sequences of MPEG-4 HFS packets. The interleaving processes are done after the overall channel coding process to combat the block-fading effects. The computer simulations summarize the system performance in terms of average WER and PSNR (dB). With the interleavers, the significant improvement in PSNR of about 15-17 dB is obtained for both ML and MAP decoding. Also in many cases, we obtain more improvement of about 0.2-0.4 dB for using MAP decoding with the interleavers.
When we design a robust vector quantizer (VQ) for noisy channels, an appropriate index assignment function should be contrived to minimize the channel-error effect. For relatively high rates, the complexity for finding an optimal index assignment function is too high to be implemented. To overcome such a problem, we use a structurally constrained VQ, which is called the sample-adaptive product quantizer (SAPQ) [12], for low complexities of quantization and index assignment. The product quantizer (PQ) and its variation SAPQ [13], which are based on the scalar quantizer (SQ) and thus belong to a class of the binary lattice VQ [16], have inherent error resilience even though the conventional affine index assignment functions, such as the natural binary code, are employed. The error resilience of SAPQ is observed in a weak sense through worst-case bounds. Using SAPQ for noisy channels is useful especially for high rates, e.g., > 1 bit/sample, and it is numerically shown that the channel-limit performance of SAPQ is comparable to that of the best codebook permutation of binary switching algorithm (BSA) [23]. Further, the PQ or SAPQ codebook with an affine index assignment function is used for the initial guess of the conventional clustering algorithm, and it is shown that the performance of the best BSA can be easily achieved.
Let us introduce n ( ≥ 2) mappings fi (i=1,,n ≡ 0) defined on reflexive real Banach spaces Xi-1 and let fi:Xi-1 → Yi be completely continuous on bounded convex closed subsets Xi-1(0) ⊂ Xi-1. Moreover, let us introduce n set-valued mappings Fi : Xi-1 Yi → Fc(Xi) (the family of all non-empty compact subsets of Xi), (i=1,,n ≡ 0). Here, we have a fixed point theorem in weak topology on the successively recurrent system of set-valued mapping equations:xi ∈ Fi(xi-1, fi(xi-1)), (i=1,,n ≡ 0). This theorem can be applied immediately to analysis of the availability of system of circular networks of channels undergone by uncertain fluctuations and to evaluation of the tolerability of behaviors of those systems.
Time variations of wireless multipath channels can lead to severe intercarrier interference (ICI) in orthogonal frequency division multiplex (OFDM) systems, whereas large Doppler frequency spread can provide us with time diversity gain. In order to take advantage of the time diversity and to suppress the interference and noise enhancement at the same time, the receiver normally detects the data successively. In this letter, we propose an improved detection ordering based on the log-likelihood ratio (LLR) rather than the signal-to-noise ratio (SNR) for the successive detector. Using both theoretical analysis and computer simulation, it is shown that this scheme outperforms the traditional successive detection methods.
Zhaoxi FANG Xiaojing BAO Liangbin LI Zongxin WANG
In this paper, we consider a dual-hop wireless cooperative network with amplify-and-forward (AF) relaying. The output signal-to-noise ratio (SNR) at the destination of the AF cooperative networks is in the form of the sum of harmonic mean of the source-relay channel SNR and the relay-destination channel SNR. Instead of deriving the exact probability density function (PDF) of the output SNR, we study the series expansion of this PDF around zero. This result is then applied to evaluate the performance of the AF cooperative systems over Nakagami-m fading channels, and closed-form high-SNR approximations of the average symbol error rate (SER) and the outage probability are derived. Next, we investigate the optimal power allocation (OPA) among the source node and the relays to minimize the approximate SER as well as the outage probability. It is shown that the optimal power allocation depends on the channel m parameters and the ratio of the source-relay channel gain to the relay-destination gain. In addition to the optimal power allocation, we also propose a low complexity sub-optimal power allocation (SubOPA) scheme. The performance improvement with optimal and sub-optimal power allocation is analyzed and validated by numeric results. It is shown that equal power allocation is near optimal when the relays are close to the source, while significant performance improvement is observed by both the optimal and sub-optimal power allocation schemes when the relays are close to the destination.
The transmission of correlated messages over strong interference channels is examined. The result is the proposal of a single-letter characterization of the sum-rate capacity of strong interference channels with correlated messages. It is shown that if the messages are independent, the sum-rate capacity is equal to that of [1] obtained by Costa and El Gamal. However, it can be larger than that of [1] if the messages are correlated. It is also shown that, in terms of the sum-rate, the achievable rate region in [2] is indeed the sum-rate capacity.
Dongju KIM Myonghee PARK Jeongho PARK Kyunbyoung KO
The authors present an accurate analysis for multicode code division multiple access (CDMA) systems equipped with a multipath interference canceler (MPIC) over multipath fading channels. This letter verifies that the previous analysis has used the additional Gaussian approximation (AGA) for multipath interferences so that there is the performance mismatch between the previous analysis and simulations. Furthermore, it is confirmed that the proposed analysis, which does not use AGA, provides an analytical bound.
Kenichi NAGAOKA Chun-Xiang CHEN Masaharu KOMATSU
In this paper, we investigate the throughput efficiency of the Go-Back-N ARQ protocol on parallel multiple channels with burst errors. We assume that packet errors occur according to a two-state Markov chain on each channel. The effect of the decay factor of the Markov chain on throughput efficiency is evaluated based on the results of numerical analysis.
A detector for space-time block coding is proposed to combat time-selective fading. To suppress both noise and interference, a minimum mean square error (MMSE) based detector is introduced for space-time block coding. It is shown by simulations that the proposed detector outperforms the conventional detectors when the channel is time-selective fading.