Mariko HIROKAWA Yoshimitsu KUROKI
PCA-L1 (principal component analysis based on L1-norm maximization) is an approximate solution of L1-PCA (PCA based on the L1-norm), and has robustness against outliers compared with traditional PCA. However, the more dimensions the feature space has, the more calculation time PCA-L1 consumes. This paper focuses on an initialization procedure of PCA-L1 algorithm, and proposes a fast method of PCA-L1 using Gram-Schmidt orthogonalization. Experimental results on face recognition show that the proposed method works faster than conventional PCA-L1 without decrease of recognition accuracy.
Yuelin MA Yasushi YAMAO Yoshihiko AKAIWA
Compensation for the nonlinear systems represented by polynomials involves polynomial inverse. In this paper, a new algorithm is proposed that gives the baseband polynomial inverse with a limited order. The algorithm employs orthogonal basis that is predetermined from the distribution of input signal and finds the coefficients of the inverse polynomial to minimize the mean square error. Compared with the well established p-th order inverse method, the proposed method can suppress the distortions better including higher order distortions. It is also extended to obtain memory polynomial inverse through a feedback-configured structure. Both numerical simulations and experimental results demonstrate that the proposed algorithm can provide good performance for compensating the nonlinear systems represented by baseband polynomials.
In this letter, we prove that for fading multiuser orthogonal frequency division multiplexing networks, a simple fixed rate scheduling scheme with only 1 bit channel state information feedback is capable of achieving the optimal performance in the wideband limit. This result indicates that the complexities of both the feedback and channel coding schemes can be reduced with nearly no system performance penalty in wideband wireless communication environments.
In this paper, an extended best linear unbiased estimator (EBLUE) based on a periodic training sequence is proposed and investigated for frequency offset estimation in orthogonal frequency division multiplexing (OFDM) systems. The structure of EBLUE is general and flexible so it adapts to different complexity constraints, and is attractive in practical implementation. Performance analysis and design strategy of EBLUE are provided to realize the best tradeoff between performance and complexity. Moreover, closed-form results of both weight and performance make EBLUE even more attractive in practical implementation. Both the performance and complexity of EBLUE are compared with other proposals and the Cramer-Rao lower bound (CRLB) to demonstrate the merit of EBLUE.
The cooperative orthogonal frequency-division multiplexing (OFDM) relaying system is widely regarded as a key design for future broadband mobile cellular systems. This paper focuses on channel estimation in such a system that uses amplify-and-forward (AF) as the relaying strategy. In the cooperative AF relaying, the destination requires the individual (disintegrated) channel state information (CSI) of the source-relay (S-R) and relay-destination (R-D) links for optimum combination of the signals received from source and relay. Traditionally, the disintegrated CSIs are obtained with two channel estimators: one at the relay and the other at the destination. That is, the CSI of the S-R link is estimated at relay and passed to destination, and the CSI of the R-D link is estimated at destination with the help of pilot symbols transmitted by relay. In this paper, a new disintegrated channel estimator is proposed; based on an expectation-maximization (EM) algorithm, the disintegrated CSIs can be estimated solely by the estimator at destination. Therefore, the new method requires neither signaling overhead for passing the CSI of the S-R link to destination nor pilot symbols for the estimation of the R-D link. Computer simulations show that the proposed estimator works well under the signal-to-noise ratios of interest.
Jungo GOTO Osamu NAKAMURA Kazunari YOKOMAKURA Yasuhiro HAMAGUCHI Shinsuke IBI Seiichi SAMPEI
This paper proposes a spectrum-overlapped resource management (SORM) technique where each user equipment (UE) can ideally obtain the frequency selection diversity gain under multi-user environments. In the SORM technique for cellular systems, under assumption of adopting a soft canceller with minimum mean square error (SC/MMSE) turbo equalizer, an evolved node B (eNB) accepts overlapped frequency resource allocation. As a result, each UE can use the frequency bins having the highest channel gain. However, the SORM becomes non-orthogonal access when the frequency bins having high channel gain for UEs are partially identical. In this case, the inter-user interference (IUI) caused by overlapping spectra among UEs is eventually canceled out by using the SC/MMSE turbo equalizer. Therefore, SORM can achieve better performance than orthogonal access e.g. FDMA when the IUI is completely canceled. This paper demonstrates that SORM has the potential to improve transmission performance, by extrinsic information transfer (EXIT) analysis. Moreover, this paper evaluates the block error rate (BLER) performance of the SORM and the FDMA. Consequently, this paper shows that the SORM outperforms the FDMA.
Agus SUSILO Tomoko K. MATSUSHIMA Yasuaki TERAMACHI
Two-dimensional (2-D) codes for optical code-division multiple access (O-CDMA) systems can increase the number of subscribers and simultaneous users as compared to one-dimensional time-spreading codes. Multiple-wavelength optical orthogonal code (MWOOC), which is one of the 2-D codes, uses prime sequences as a wavelength-hopping code and an optical orthogonal code (OOC) as a time-spreading code. MWOOCs have some advantages over other 2-D codes especially in high bit-rate O-CDMA systems. The only drawback of MWOOC is that the performance degrades significantly when the number of wavelengths is not prime. Recently a generalized class of modified prime sequence codes (MPSCs), which includes the class of original MPSCs as its subclass, was presented. An important property of generalized MPSCs is that the codes can be constructed over not only prime fields but also extension fields. It has been shown that the correlation property of generalized MPSCs is the same as that of the original MPSCs. This paper investigates MWOOC with generalized prime sequences, which can be obtained in the process of generating the generalized MPSCs, as a wavelength-hopping code. Use of the generalized prime sequences can solve the nonprime problem of MWOOCs. The average error probability of the proposed MWOOCs is formulated theoretically and numerical results are compared with that of the original schemes. It is shown that nonprime numbers, such as 2m, 3m and 5m, can be also taken as the number of wavelengths without degrading the system performance in the proposed systems.
Xiaodong SUN Shihua ZHU Zhenjie FENG Hui HUI
In this letter, we derive a lower bound on the diversity multiplexing tradeoff (DMT) in multiple-input multiple-output (MIMO) nonorthogonal amplify-and-forward (NAF) cooperative channels with resolution-constrained channel state feedback. It is shown that power control based on the feedback improves the DMT performance significantly in contrast to the no-feedback case. For instance, the maximum diversity increase is exponential in K with K-level feedback.
Xiaorun ZHONG Dianhua WU Pingzhi FAN
Variable-weight optical orthogonal codes (OOCs) were introduced by Yang for multi-media optical CDMA systems with multiple quality of service (QoS) requirements. Some works had been done on the existence of optimal (υ,W,1,Q)-OOCs for W ∈ {{3,4}, {3,5}, {4,5}}. In this paper, by using quadratic residues, seven new infinite classes of optimal (υ,{k,6},1,Q)-OOCs for k ∈ {3,4} are constructed.
Hsin-De LIN Tzu-Hsien SANG Jiunn-Tsair CHEN
For advanced mobile communication systems that adopt orthogonal frequency-division multiple access (OFDMA) technologies, intercarrier interference (ICI) significantly degrades performance when mobility is high. Standard specifications and concerns about complexity demand low-cost methods with deployment readiness and decent performance. In this paper, novel zero forcing (ZF) and minimum mean-square error (MMSE) equalizers based on per-subcarrier adaptive (PSA) processing and perturbation-based (PB) approximation are introduced. The proposed equalizers strike a good balance between implementation cost and performance; therefore they are especially suitable for OFDMA downlink receivers. Theoretical analysis and simulations are provided to verify our claims.
Xiyang LI Pingzhi FAN Naoki SUEHIRO Dianhua WU
Variable-weight optical orthogonal codes (OOCs) have application in multimedia optical code division multiple access (OCDMA) systems supporting multiple quality of services (QoS). In this paper, several combinatorial constructions for optimal variable-weight OOCs are presented explicitly. A useful recursive construction for optimal variable-weight OOCs is proposed as well. Based on these results, two new infinite classes of optimal variable-weight OOCs with Hamming weights 3 and 4 are obtained.
We apply the Hadamard equivalence to all the binary matrices of the size mn and study various properties of this equivalence relation and its classes. We propose to use HR-minimal as a representative of each equivalence class, and count and/or estimate the number of HR-minimals of size mn. Some properties and constructions of HR-minimals are investigated. Especially, we figure that the weight on an HR-minimal's second row plays an important role, and introduce the concept of Quasi-Hadamard matrices (QH matrices). We show that the row vectors of mn QH matrices form a set of m binary vectors of length n whose maximum pairwise absolute correlation is minimized over all such sets. Some properties, existence, and constructions of Quasi-orthogonal sequences are also discussed. We also give a relation of these with cyclic difference sets. We report lots of exhaustive search results and open problems, one of which is equivalent to the Hadamard conjecture.
Jing JIANG Dianhua WU Pingzhi FAN
Optical orthogonal codes (OOCs) were introduced by Salehi, as signature sequences to facilitate multiple access in optical fibre networks. The existence of optimal (υ,3,1)-OOCs had been solved completely. Although there are some partial results, the existence of optimal (υ, 4, 1)-OOCs is far from settled. In this letter, three general constructions for (υ, 4, 1)-OOCs via perfect difference families are presented, new infinite classes of (υ, 4, 1)-OOCs are then obtained.
Wenting CHANG Jintao WANG Bo AI
A scheme that modulates the training sequence is proposed to support two-layer data streams in the time domain synchronous orthogonal frequency division multiplex (TDS-OFDM) systems. A theoretical analysis and computer simulation show that the proposed scheme works well and that the two layer data streams are compatible with each other.
Mai OHTA Takeo FUJII Kazushi MURAOKA Masayuki ARIYOSHI
In this study, we propose a cooperative sensing with distributed pre-detection for gathering sensing information on shared primary system. We have proposed a system that gathers multiple sensing information by using the orthogonal narrowband signal; the system is called the orthogonal frequency-based sensing information gathering (OF-SIG) method. By using this method, sensing information from multiple secondary nodes can be gathered from the surrounding secondary nodes simultaneously by using the orthogonal narrowband signals. The advantage of this method is that the interference from each node is small because a narrowband tone signal is transmitted from each node. Therefore, if appropriate power and transmission control are applied at the surrounding nodes, the sensing information can be gathered in the same spectrum as the primary system. To avoid interference with the primary receiver, we propose a cooperative sensing with distributed pre-detection for gathering sensing information in each node by limiting sensing node power. In the proposed method, the number of sensing information transmitting nodes depends on the pre-detection ability of the individual sensing at each node. Then the secondary node can increase the transmit power by improving the sensing detection ability, and the secondary node can gather the sensing information from the surrounding secondary nodes which are located more far by redesign the transmit power of the secondary nodes. Here, we design the secondary transmit power based on OF-SIG while considering the aggregated interference from multiple sensing nodes and individual sensing ability. Finally we confirm the performance of the cooperative sensing of the proposed method through computer simulation.
Shoichiro MATSUMOTO Koji KAMAKURA
We propose an interference avoidance architecture using uneven spreading as a media access mechanism for optical code division multiple access (OCDMA). While an equal-intensity pulse sequence encoded with the spreading sequence assigned to each node is transmitted for a “1” bit in conventional OCDMA with on-off keying (OOK), the proposed architecture creates an uneven-intensity pulse sequence where one of the pulses has higher intensity than the others. The high-intensity pulse allows source nodes to use increased sensing threshold for channel sensing, which leads to an increase in the number of chip offsets available for collision-free transmission. Our receiver with a hard limiter (HL) allows destination nodes to receive the transmission without false positives. Interference avoidance performance is examined by deriving the collision probability and comparing it with the conventional interference avoidance with equal-intensity spreading. Our numerical results show that our architecture has lower collision probability, shorter time required for channel sensing, higher throughput, higher bit rate, and supports more nodes than the conventional one for a fixed collision probability.
Dongpei LIU Hengzhu LIU Botao ZHANG Jianfeng ZHANG Shixian WANG Zhengfa LIANG
High-performance FFT processor is indispensable for real-time OFDM communication systems. This paper presents a CORDIC based design of variable-length FFT processor which can perform various FFT lengths of 64/128/256/512/1024/2048/4096/8192-point. The proposed FFT processor employs memory based architecture in which mixed radix 4/2 algorithm, pipelined CORDIC, and conflict-free parallel memory access scheme are exploited. Besides, the CORDIC rotation angles are generated internally based on the transform of butterfly counter, which eliminates the need of ROM making it memory-efficient. The proposed architecture has a lower hardware complexity because it is ROM-free and with no dedicated complex multiplier. We implemented the proposed FFT processor and verified it on FPGA development platform. Additionally, the processor is also synthesized in 0.18 µm technology, the core area of the processor is 3.47 mm2 and the maximum operating frequency can be up to 500 MHz. The proposed FFT processor is better trade off performance and hardware overhead, and it can meet the speed requirement of most modern OFDM system, such as IEEE 802.11n, WiMax, 3GPP-LTE and DVB-T/H.
Rainfield Y. YEN Hong-Yu LIU Chia-Sheng TSAI
For maximum-likelihood (ML) estimation to jointly track carrier frequency offset (CFO) and channel impulse response (CIR) in orthogonal frequency division multiplexing (OFDM) systems, we present a finite high order approximation method utilizing the MATLAB ‘roots' command on the log-likelihood function derived from the OFDM received signal, coupled with an adaptive iteration algorithm. The tracking performance of this high order approximation algorithm is found to be excellent, and as expected, the algorithm outperforms the other existing first order approximation algorithms.
This paper addresses conjugate-gradient (CG) based pilot-assisted channel estimation and equalization in doubly selective channels for orthogonal frequency division multiplexing (OFDM) block transmissions. With the help of the discrete prolate spheroidal sequence, which shows flat mean-square error (MSE) curves for the reconstructed channels in the presence of Doppler frequency mismatch, a basis expansion model for a parsimonious channel representation over multiple OFDM blocks is developed, a system equation for the least square channel estimation under widely used pilot lattices, where the pilot symbols are irregularly placed in the subcarrier domain, is formulated by introducing carving matrices, and the standard CG method is applied to the system. Relying on the CG method again, the linear minimum mean-square error channel equalization is pursued without performing any matrix inversion, while elevating the convergence speed of the iterative algorithm with a simple preconditioner. Finally, we validate our schemes with numerical experiments on the integrated services digital broadcasting-terrestrial system in doubly-selective channels and determine the normalized MSE and uncoded bit error rate.
Ziming HE Yi MA Rahim TAFAZOLLI
This letter presents a novel opportunistic cooperative positioning approach for orthogonal frequency-division multiple access (OFDMA) systems. The basic idea is to allow idle mobile terminals (MTs) opportunistically estimating the arrival timing of the training sequences for uplink synchronization from active MTs. The major advantage of the proposed approach over state-of-the-arts is that the positioning-related measurements among MTs are performed without the paid of training overhead. Moreover, Cramer-Rao lower bound (CRLB) is utilized to derive the positioning accuracy limit of the proposed approach, and the numerical results show that the proposed approach can improve the accuracy of non-cooperative approaches with the a-priori stochastic knowledge of clock bias among idle MTs.