A5065074102- Advanced Wireless Communication Techniques
- Cooperative Communication and Network Coding
- Coding theory and cryptography
- Wireless Communication Networks Research
- Error Correcting Code Techniques
- Advanced Wireless Communication Technologies
- Advanced MIMO Systems Optimization
- Wireless Communication Security Techniques
- graph theory and CDMA systems
- Cellular Automata and Applications
- Full-Duplex Wireless Communications
- Algorithms and Data Compression
- PAPR reduction in OFDM
- Power Line Communications and Noise
- DNA and Biological Computing
- QR Code Applications and Technologies
- Energy Harvesting in Wireless Networks
- Advanced Data Storage Technologies
- Caching and Content Delivery
- Advanced Data Compression Techniques
- Advanced Wireless Network Optimization
- Magnetic properties of thin films
- Electromagnetic Compatibility and Noise Suppression
- Antenna Design and Optimization
- Advanced Steganography and Watermarking Techniques
Hong Kong University of Science and Technology
2015-2024
University of Hong Kong
2015-2024
Southwest Jiaotong University
2017
University of California, San Diego
2010
Guangzhou HKUST Fok Ying Tung Research Institute
2009
City University of Hong Kong
2009
University of Science and Technology Beijing
2008
University of Macau
2004
Nanyang Technological University
1997-2003
University of Waterloo
1995-2002
Lattice decoding algorithms have been proposed for implementing the maximum likelihood detector (MLD), which is optimal receiver multiple-input multiple-output (MIMO) channels. However computational complexity of direct implementation lattice algorithm high and throughput variable. In this work, a K-best to implement decoding. It inexpensive has fixed throughput. can be easily implemented in pipelined fashion similar performance as if value K used. paper, we describe VLSI architecture...
By employing spatial multiplexing, multiple-input multiple-output (MIMO) wireless antenna systems provide increases in capacity without the need for additional spectrum or power. Zero-forcing (ZF) detection is a simple and effective technique retrieving multiple transmitted data streams at receiver. However requires knowledge of channel state information (CSI) practice accurate CSI may not be available. In this letter, we investigate effect estimation error on performance MIMO ZF receivers...
Recently, lattice-reduction-aided detectors have been proposed for multiinput multioutput (MIMO) systems to achieve performance with full diversity like the maximum likelihood receiver. However, these are based on traditional Lenstra-Lenstra-Lovasz (LLL) reduction algorithm that was originally introduced reducing real lattice bases, in spite of fact channel matrices inherently complex-valued. In this paper, we introduce complex LLL direct application basis a which is naturally defined by...
WIRELESS COMMUNICATIONS (Twireless) contains high-quality technical manuscripts on advances in the state of art wireless communications.Both theoretical contributions (including new techniques, concepts, and analyses) practical system experiments, prototypes, applications) are encouraged.Tutorial expositions permanent reference value also welcome.All members IEEE eligible for membership Society upon payment annual fee $30.00.
The single-layer perceptron, introduced by Rosenblatt in 1958, is one of the earliest and simplest neural network models. However, it incapable classifying linearly inseparable patterns. A new era research started 1986, when backpropagation (BP) algorithm was rediscovered for training multilayer perceptron (MLP) model. An MLP with a large number hidden nodes can function as universal approximator. To date, model most fundamental important It also investigated Even this AI or deep learning...
Frequency-division duplexing and time-division are two common methods used in various wireless systems. However, there advantages technical issues associated with them. In this article we discuss detail the features, design implementation challenges of FDD TDD systems for 4G particular, present a number flexibilities an system can bring to that cannot offer, identify major challenges, including cross-slot interference, applying practice. Due fact interference is one critical employing...
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood receiver yet complexity similar linear receiver. However, these are based on the traditional LLL reduction algorithm that was originally introduced reducing real lattice basis, even though channel matrices inherently complex-valued. In this paper, we introduce complex direct application matrix which naturally defines...
Cognitive radio technology facilitates spectrum reuse and alleviates crunch. One fundamental problem in cognitive is to avoid the interference caused by other communication systems sharing same frequency band. However, sensing cannot guarantee accurate detection of many practical situations. Hence, it crucial design robust receivers combat in-band interference. In this paper, we first present a simple pilot aided method. To residual that be detected detector, further propose joint decoding...
The recently proposed loosely synchronized (LS) spreading code can in principle realize an intracell-interference-free quasi-synchronous code-division multiple-access (QS-CDMA) system by creating a wide enough interference-free window (IFW). However, the problem of minimizing intercell interference (ICI) cellular QS-CDMA remains open issue. Addressing from sequence design viewpoint, key challenge is how to generalize known construction single LS many families generalized (GLS) codes so that...
In this paper, we examine and compare the potential maximum sum capacity of downlink multiple-input-multiple-output orthogonal frequency division multiple access (MIMO-OFDMA) multicarrier code (MIMO-MC-CDMA) in a single-cell multiuser environment with channel side information at transmitter, without fairness constraint. The resource allocation is formulated as cross-layer optimization framework optimal power user selection algorithms are proposed for both scenarios. We find that...
Cognitive radio (CR) technology is a promising way to improve the bandwidth efficiency of underutilized spectra. For practical CR systems with limited <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">a priori</i> knowledge primary users' signal characteristics, spectrum sensing mainly based on energy detection and cyclostationary feature detection. Energy simple but becomes ineffective at low signal-to-interference-and-noise ratio (SINR)....
The detriment arising from strong and frequently occurring impulses over an Orthogonal Frequency Division Multiplexing system is paramount because signals on sub-carriers appear to be corrupted simultaneously. To overcome this obstacle, clipping has been reported as effective approach. Unlike previous works, work derived the threshold without assuming a priori knowledge of probability density function (PDF) impulsive noise, which usually unobtainable in precise measure most practical...
Nowadays, 2D barcodes have been widely used as an interface to connect potential customers and advertisement contents. However, the appearance of a conventional barcode pattern is often too obtrusive for integrating into aesthetically designed advertisement. Besides, no human readable information provided before successfully decoded. This paper proposes new picture-embedding barcode, called PiCode, which mitigates these two limitations by equipping scannable with picturesque appearance....
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or compressible signals. Sparse coding represents a signal as linear combination of atoms, which are elementary signals derived from predefined dictionary. sensing, approximation, and dictionary learning topics similar coding. Matrix completion the process recovering data matrix subset its entries, it extends principles compressed approximation. The nonnegative factorization low-rank technique data. All...
Abstract The idea of formulating the detection a lattice‐type modulation, such as M‐PAM and M‐QAM, transmitted over linear channel so‐called universal lattice decoding problem dates back to at least early 1990s. applications decoders have proliferated in last few years because growing importance some models multiple‐antenna fading channels multi‐user CDMA channels. principle can trace its roots theory algorithms developed for solving shortest/closest vector integer programming cryptoanalysis...
Considers the problem of data detection in multilevel lattice-type modulation systems presence intersymbol interference and additive white Gaussian noise. The conventional maximum likelihood sequence estimator using Viterbi algorithm has a time complexity O(m/sup /spl nu/+1/) operations per symbol space O(/spl delta/m/sup nu//) storage elements, where m is size input alphabet, nu/ length channel memory, delta/ truncation depth. By revising scheme viewing as linear transform, authors identify...
In the literature, many constructions of zero correlation zone (ZCZ) sequences have been reported. While most them are suboptimal with respect to known upper bound, some constructed by Matsufuji et al. and Torii respectively, almost optimal (or even optimal). this paper, we propose a systematic construction ZCZ sequence sets which generalizes aforementioned so that more flexible relationships between set size length allowed. particular, obtained m mn new for 1 < gcd(m, n) min(m, n)....
The Lenstra-Lenstra-Lovász (LLL) algorithm is a popular lattice reduction in communications. In this paper, variants of the LLL with either reduced or fixed complexity are proposed and analyzed. Specifically, use effective for decoding presented, where size only performed pairs consecutive basis vectors. Its average (measured by number floating-point operations averaged over i.i.d. standard normal bases) shown to be O(n <sup xmlns:mml="http://www.w3.org/1998/Math/MathML"...
Network-on-chip (NoC) based multiprocessor system-on-chips (MPSoCs) have been proposed as promising architectures to meet modern applications' ever-increasing demands for computing capability under limited power budget. Understanding the behaviors of MPSoC applications is key design MPSoCs tight and performance constraints. In this case study, we systematically examine computation communication four real on three popular NoC topologies. We formally model task graphs (TCG) accurately capture...
Perfect root-of-unity sequences (PRUS) have found applications in numerous spread spectrum systems such as pulse compression radars, DS/SSMA, FH/SSMA, etc. A unified PRUS construction, which includes all known constructions special cases, was previously devised by this author. In paper, a class of sequence sets with certain interesting correlation properties is identified very important source PRUS. By deriving general construction sets, new, even more obtained. addition, new lower bound on...
Few works have addressed the effect of CFO (carrier frequency offset) on channel estimation performance. In this paper, compact analytical expressions mean square error in presence are derived for OFDM (orthogonal division multiplexing) systems employing single and multiple antennas. Concise upper bounds also SISO-OFDM systems. It is revealed that MSE (mean error) increases at rate approximately increasing number pilots does not contribute to better suppression caused by CFO. addition, it...
This paper analyzes bit error rate (BER) and outage probability of singular value decomposition-based multiple-input multiple-output systems with channel estimation feedback delay over uncorrelated Ricean fading channels. By utilizing marginal unordered ordered eigenvalue distributions complex noncentral Wishart matrices, we derive exact closed-form expressions on the average system performance high signal- to-interference-plus-noise ratio (SINR) approximations individual eigen-subchannels,...
Levenshtein improved the famous Welch bound on aperiodic correlation for binary sequences by utilizing some properties of weighted mean square correlation. Following Levenshtein's idea, a new lower quasi-complementary sequence sets (QCSSs) over complex roots unity is proposed in this paper. The derived shown to be tighter than QCSSs when set size greater value. conditions meeting with equality are also investigated.
Due to the use of commodity software and hardware, crash-stop Byzantine failures are likely be more prevalent in today's large-scale distributed storage systems. Regenerating codes have been shown a efficient way disperse information across multiple nodes recover literature. In this paper, we present design regeneration conjunction with integrity check that allows exact failed data reconstruction presence failures. A progressive decoding mechanism is incorporated both procedures leverage...
Binary sequences with low aperiodic autocorrelation levels, defined in terms of the peak sidelobe level (PSL) and/or merit factor, have many important engineering applications, such as radars, sonars, spread spectrum communications, system identification, and cryptography. Searching for binary (LABS) is a notorious combinatorial problem, has been chosen to form benchmark test constraint solvers. Due its prohibitively high complexity, an exhaustive search solution impractical, except...