Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Tung-Sang Ng is active.

Publication


Featured researches published by Tung-Sang Ng.


IEEE Transactions on Wireless Communications | 2004

Generalized multiuser orthogonal space-division multiplexing

Zhengang Pan; Kai-Kit Wong; Tung-Sang Ng

This paper addresses the problem of performing orthogonal space-division multiplexing (OSDM) for downlink, point-to-multipoint communications when multiple antennas are utilized at the base station (BS) and (optionally) all mobile stations (MS). Based on a closed-form antenna weight solution for single-user multiple-input multiple-output communications in the presence of other receiver points, we devise an iterative algorithm that finds the multiuser antenna weights for OSDM in downlink or broadcast channels. Upon convergence, each mobile user will receive only the desired activated spatial modes with no cochannel interference. Necessary and sufficient conditions for the existence of OSDM among the number of mobile users, the number of transmit antennas at the BS, and the number of receive antennas at the MS, are also derived. The assumption for the proposed method is that the BS knows the channels for all MSs and that the channel dynamics are quasi-stationary.


IEEE Transactions on Communications | 1999

Performance of asynchronous orthogonal multicarrier CDMA system in frequency selective fading channel

Xiang Gui; Tung-Sang Ng

An asynchronous multicarrier (MC) direct-sequence (DS) code-division multiple-access (CDMA) scheme for the uplink of the mobile communication system operating in a frequency selective fading channel is analyzed. The bit error rate performance of the system with either equal gain combining or maximum-ratio combining is obtained. Numerical results indicate that the system performs better than that of the conventional DS-CDMA system and another MC-DS-CDMA system.


IEEE Transactions on Signal Processing | 2004

A semi-blind channel estimation method for multiuser multiantenna OFDM systems

Yonghong Zeng; Tung-Sang Ng

A subspace-based blind method is proposed for estimating the channel responses of a multiuser and multiantenna orthogonal frequency division multiplexing (OFDM) uplink system. It gives estimations to all channel responses subject to a scalar matrix ambiguity and does not need precise channel order information (only an upper bound for the orders is required). Furthermore, the scalar ambiguity matrix can be easily resolved by using only one pilot OFDM block, given that the number of users is smaller than the number of symbols in the pilot symbol block. Equalization methods are discussed based on the estimated channels. By using partial knowledge of the channels, a multipath subspace method is proposed that reduces the computational complexity. Simulations show that the methods are effective and robust.


IEEE Transactions on Circuits and Systems Ii: Analog and Digital Signal Processing | 2000

Least mean M-estimate algorithms for robust adaptive filtering in impulse noise

Yuexian Zou; Shing-Chow Chan; Tung-Sang Ng

Adaptive filters with suitable nonlinear devices are very effective in suppressing the adverse effect due to impulse noise. In a previous work, the authors have proposed a new class of nonlinear adaptive filters using the concept of robust statistics [1,2]. The robust M-estimator is used as the objective function, instead of the mean square errors, to suppress the impulse noise. The optimal coefficient vector for such nonlinear filter is governed by a normal equation which can be solved by a recursive least squares like algorithm with O(N2) arithmetic complexity, where N is the length of the adaptive filter. In this paper, we generalize the robust statistic concept to least mean square (LMS) and transform domain LMS algorithms. The new fast nonlinear adaptive filtering algorithms called the least mean M-estimate (LMM) and transform domain LMM (TLMM) algorithms are derived. Simulation results show that they are robust to impulsive noise in the desired and input signals with an arithmetic complexity of order O(N).


IEEE Transactions on Wireless Communications | 2010

Robust beamforming in cognitive radio

Gan Zheng; Shaodan Ma; Kai-Kit Wong; Tung-Sang Ng

This letter considers the multi-antenna cognitive radio (CR) network, which has a single secondary user (SU) and coexists with a primary network of multiple users. Our objective is to maximize the service probability of the SU, subject to the interference constraints on the primary users (PUs) in the form of probability. Exploiting imperfect channel state information (CSI), with its error modeled by added Gaussian noise, we address the optimization for the beamforming weights at the secondary transmitter. In particular, this letter devises an iterative algorithm that can efficiently obtain the robust optimal beamforming solution. For the case with one PU, we show that a much simpler algorithm based on a closed-form solution for the antenna weights of a given power can be presented. Numerical results reveal that the optimal solution for the constructed problem provides an effective means to tradeoff the performance between the PUs and the SU, bridging the non-robust and worst-case based systems.


IEEE Transactions on Communications | 2000

A simulation model for Nakagami-m fading channels, m<1

Kun-Wah Yip; Tung-Sang Ng

This paper proposes a mathematical model for simulating a Nakagami-m (1960) fading channel, m<1. It is shown that the m fading process can be expressed as a product of a square-root-beta process and a complex Gaussian process. Extension of the proposed model to simulate correlated diversity channels is also given. Numerical results demonstrate that the statistical properties of the samples generated from the proposed model are close to the required ones.


IEEE Transactions on Wireless Communications | 2004

A consistent OFDM carrier frequency offset estimator based on distinctively spaced pilot tones

Jing Lei; Tung-Sang Ng

A pilot-tone-based maximum likelihood estimator (PBMLE) for carrier frequency offset (CFO) in orthogonal frequency-division multiplexing (OFDM) systems is proposed. To obtain a consistent estimate of the CFO over a frequency-selective fading channel, the proposed method employs a preamble comprising distinctively spaced pilot tones. As a result of this preamble configuration, a large estimation range equal to the bandwidth of the OFDM signal can be achieved. Different from previous ad hoc pilot-tone-based CFO estimators, the PBMLE exploits the relationship between the CFO and the periodogram of the preamble. Analysis shows that the proposed PBMLE is asymptotically unbiased and efficient. To realize this PBMLE in practice, a suboptimal estimator is also introduced, in which a zero-padded fast Fourier transform is invoked and the CFO estimation is split into two phases: coarse and fine estimation. Coarse estimation is obtained through the correlation between the received preamble and its original pattern, whereas fine estimation is obtained by exploiting the magnitude attenuation in the vicinities of those CFO-shifted pilot tones. Both analytical investigations and computer simulations indicate that the accuracy of this simplified suboptimal estimator is proportional to the oversize ratio of zero padding. When the oversize ratio is sufficiently high, the performance of the suboptimal estimator approaches that of the proposed PBMLE.


IEEE Journal on Selected Areas in Communications | 2008

Robust subspace blind channel estimation for cyclic prefixed MIMO ODFM systems: algorithm, identifiability and performance analysis

Feifei Gao; Yonghong Zeng; Arumugam Nallanathan; Tung-Sang Ng

A novel subspace (SS) based blind channel estimation method for multi-input, multi-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems is proposed in this work. With an appropriate re-modulation on the received signal blocks, the SS method can be effectively applied to the cyclic prefix (CP) based MIMO-OFDM system when the number of the receive antennas is no less than the number of transmit antennas. These features show great compatibility with the coming fourth generation (4G) wireless communication standards as well as most existing single-input single-output (SISO) OFDM standards, thus allow the proposed algorithm to be conveniently integrated into practical applications. Compared with the traditional SS method, the proposed algorithm exhibits many advantages such as robustness to channel order over-estimation, capability of guaranteeing the channel identifiability etc. Analytical expressions for the mean-square error (MSE) and the approximated Cramer-Rao bound (ACRB) of the proposed algorithm are derived in closed forms. Various numerical examples are conducted to corroborate the proposed studies.


personal indoor and mobile radio communications | 2000

Performance tradeoffs between maximum ratio transmission and switched-transmit diversity

Ching-Hok Tse; Kun-Wah Yip; Tung-Sang Ng

Implementation of maximum ratio transmission (MRT) systems is not a trivial task. Alternatively, switched-transmitter diversity (STD) systems are less difficult to implement, but their performance is suboptimal when compared to MRT systems. If the difference is not significant, implementation advantages of STD systems outweigh the minor performance loss so that these systems are desirable for practical implementations. This paper compares the performances between MRT and STD systems under Rayleigh-fading conditions for 2/spl times/1, 2/spl times/2 and 4/spl times/ (transmit antennas/spl times/receive antennas) configurations. It is found that the differences are only about 1 dB for the 2/spl times/1 and 2/spl times/2 configurations, indicating that implementation simplicity of a STD system can be utilized without sacrificing too much performance. However, the difference is around 3 dB for the 4/spl times/ configuration. The considerably larger loss prompts system designers to consider more critically on the tradeoffs between implementation aspects and performances of STD and MRT systems.


IEEE Transactions on Communications | 1995

Efficient simulation of digital transmission over WSSUS channels

Kun-Wah Yip; Tung-Sang Ng

This paper proposes an efficient Monte Carlo method which reduces computation for digital communication simulations over a multipath Rayleigh fading, wide-sense- stationary uncorrelated-scattering (WSSUS) channel. An equivalent discrete-time channel representation, which can be realized by a FIR filter with time-variant tap gains, is employed. In the proposed method, the tap gains are generated from a linear transformation of a set of orthogonal zero-mean complex Gaussian random processes. By the central limit theorem, each random process is approximated by summing a finite number of randomly generated phasors (Monte Carlo approximation). When compared with the tap gain generation method described in earlier literature, which approximates the physical channel by the Monte Carlo approximation first and then generates the tap gain values, the proposed method demonstrates a considerable reduction in the required simulation time as well as improved accuracy under similar conditions.

Collaboration


Dive into the Tung-Sang Ng's collaboration.

Top Co-Authors

Avatar

Yik-Chung Wu

University of Hong Kong

View shared research outputs
Top Co-Authors

Avatar

Kun-Wah Yip

University of Hong Kong

View shared research outputs
Top Co-Authors

Avatar

Kai-Kit Wong

University College London

View shared research outputs
Top Co-Authors

Avatar

Ngai Wong

University of Hong Kong

View shared research outputs
Top Co-Authors

Avatar

Gan Zheng

Loughborough University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

S. C. Chan

University of Hong Kong

View shared research outputs
Top Co-Authors

Avatar

Yiqing Zhou

Chinese Academy of Sciences

View shared research outputs
Top Co-Authors

Avatar

Arumugam Nallanathan

Queen Mary University of London

View shared research outputs
Top Co-Authors

Avatar

Jianwu Chen

University of Hong Kong

View shared research outputs
Researchain Logo
Decentralizing Knowledge