The search functionality is under construction.

Author Search Result

[Author] Pingzhi FAN(28hit)

1-20hit(28hit)

  • Construction of Binary Array Set with Zero Correlation Zone Based on Interleaving Technique

    Yifeng TU  Pingzhi FAN  Li HAO  Xiyang LI  

     
    PAPER-Information Theory

      Vol:
    E94-A No:2
      Page(s):
    766-772

    Sequences with good correlation properties are of substantial interest in many applications. By interleaving a perfect array with shift sequences, a new method of constructing binary array set with zero correlation zone (ZCZ) is presented. The interleaving operation can be performed not only row-by-row but also column-by-column on the perfect array. The resultant ZCZ binary array set is optimal or almost optimal with respect to the theoretical bound. The new method provides a flexible choice for the rectangular ZCZ and the set size.

  • New Infinite Classes of Optimal (υ, {k, 6}, 1, Q) Optical Orthogonal Codes via Quadratic Residues

    Xiaorun ZHONG  Dianhua WU  Pingzhi FAN  

     
    PAPER-Sequences

      Vol:
    E95-A No:11
      Page(s):
    1827-1834

    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.

  • New Classes of Optimal Variable-Weight Optical Orthogonal Codes Based on Cyclic Difference Families

    Dianhua WU  Pingzhi FAN  Xun WANG  Minquan CHENG  

     
    PAPER-Sequences

      Vol:
    E93-A No:11
      Page(s):
    2232-2238

    Variable-weight optical orthogonal code (OOC) was introduced by G-C Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, a construction for optimal (υ, {3,4}, 1, {s/(s+1), 1/(s+1)})-OOCs is given. For s=2, it is proved that for each prime υ≡ 1(mod 24), there exists a (υ, {3,4}, 1, {2/3, 1/3})-OOC. A recursive construction for cyclic difference family is also presented. By using these constructions, a number of new infinite classes of optimal (υ, {3,4}, 1, Q)-OOCs for Q = {1/2, 1/2} and {2/3, 1/3} are constructed.

  • Quadriphase Z-Complementary Sequences

    Xudong LI  Pingzhi FAN  Xiaohu TANG  Li HAO  

     
    PAPER-Sequences

      Vol:
    E93-A No:11
      Page(s):
    2251-2257

    Aperiodic quadriphase Z-complementary sequences, which include the conventional complementary sequences as special cases, are introduced. It is shown that, the aperiodic quadriphase Z-complementary pairs are normally better than binary ones of the same length, in terms of the number of Z-complementary pairs, and the maximum zero correlation zone. New notions of elementary transformations on quadriphase sequences and elementary operations on sets of quadriphase Z-complementary sequences are presented. In particular, new methods for analyzing the relations among the formulas relative to sets of quadriphase Z-complementary sequences and for describing the sets are proposed. The existence problem of Z-complementary pairs of quadriphase sequences with zero correlation zone equal to 2, 3, and 4 is investigated. Constructions of sets of quadriphase Z-complementary sequences and their mates are given.

  • General Constructions for (υ,4,1) Optical Orthogonal Codes via Perfect Difference Families

    Jing JIANG  Dianhua WU  Pingzhi FAN  

     
    LETTER-Sequences

      Vol:
    E95-A No:11
      Page(s):
    1921-1925

    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.

  • Even-Shift Orthogonal Arrays

    Shinya MATSUFUJI  Takahiro MATSUMOTO  Pingzhi FAN  

     
    LETTER-Sequences

      Vol:
    E95-A No:11
      Page(s):
    1937-1940

    The even-shift orthogonal sequence whose out-of-phase aperiodic autocorrelation function takes zero at any even shifts is generalized to multi-dimension called even-shift orthogonal array (E-array), and the logic function of E-array of power-of-two length is clarified. It is shown that E-array can be constructed by complementary arrays, which mean pairs of arrays that the sum of each aperiodic autocorrelation function at the same phase shifts takes zero at any shift except zero shift, as well as the one-dimensional case. It is also shown that the number of mates of E-array with which the cross correlation function between E-arrays takes zero at any even shifts is equal to the dimension. Furthermore it is investigated that E-array possesses good aperiodic autocorrelation that the rate of zero correlation values to array length approaches one as the dimension becomes large.

  • Bounds on Aperiodic Autocorrelation and Crosscorrelation of Binary LCZ/ZCZ Sequences

    Daiyuan PENG  Pingzhi FAN  Naoki SUEHIRO  

     
    PAPER-Spread Spectrum Technologies and Applications

      Vol:
    E88-A No:12
      Page(s):
    3636-3644

    In order to eliminate the co-channel and multi-path interference of quasi-synchronous code division multiple access (QS-CDMA) systems, spreading sequences with low or zero correlation zone (LCZ or ZCZ) can be used. The significance of LCZ/ZCZ to QS-CDMA systems is that, even there are relative delays between the transmitted spreading sequences due to the inaccurate access synchronization and the multipath propagation, the orthogonality (or quasi-orthogonality) between the transmitted signals can still be maintained, as long as the relative delay does not exceed certain limit. In this paper, several lower bounds on the aperiodic autocorrelation and crosscorrelation of binary LCZ/ZCZ sequence set with respect to the family size, sequence length and the aperiodic low or zero correlation zone, are derived. The results show that the new bounds are tighter than previous bounds for the LCZ/ZCZ sequences.

  • Performance Evaluation for a New Quasi-Synchronous CDMA System Employing Generalized Orthogonal Sequences

    Li HAO  Pingzhi FAN  

     
    PAPER-Networking and Architectures

      Vol:
    E86-D No:9
      Page(s):
    1513-1524

    In this paper, a quasi-synchronous code-division multiple-access (QS-CDMA) is investigated for application in the reverse link of a microcellular or indoor mobile communication environment. In a QS-CDMA system, the relative time delay between the signals of different users is normally restricted within a few chips. Generalized orthogonal (GO) codes added with guard chips are employed as the spreading sequences in this paper and the strict timing error restrictions for BPSK and M-QAM modulation schemes are derived based on the correlation properties of GO code set which determines the multiple access interference (MAI). The results reveal that the system employing GO code set with bigger GO zone can tolerate more serious timing error, and higher order modulation schemes require stricter synchronization. Based on the system model presented, the BER performance for BPSK and M-QAM is evaluated by Gaussian Approximation (GA) and Monte Carlo simulation. The system capacity in terms of acquirable total bit rates are also evaluated, revealing that if system synchronization error is limited within the GO zone, M-QAM scheme can be utilized to improve the system capacity.

  • Two Types of Polyphase Sequence Sets for Approximately Synchronized CDMA Systems

    Shinya MATSUFUJI  Noriyoshi KUROYANAGI  Naoki SUEHIRO  Pingzhi FAN  

     
    PAPER-Spread Spectrum Technologies and Applications

      Vol:
    E86-A No:1
      Page(s):
    229-234

    This paper discusses two types of polyphase sequence sets, which will successfully provide CDMA systems without co-channel interference. One is a type of ZCZ sets, whose periodic auto-correlation functions take zero at continuous shifts on both side of the zero-shift, and periodic cross-ones also take zero at the continuous shifts and the zero-shift. The other is a new type of sets consisting of some subsets of polyphase sequences with zero cross-correlation zone, called ZCCZ sets, whose periodic cross-correlation functions among different subsets have take zero at continuous shifts on both side of the zero-shift including the zero-shift. The former can achieve a mathematical bound, and the latter can have large size.

  • A Downlink Multi-Relay Transmission Scheme Employing Tomlinson-Harashima Precoding and Interference Alignment

    Heng LIU  Pingzhi FAN  Li HAO  

     
    PAPER-Mobile Information Network

      Vol:
    E95-A No:11
      Page(s):
    1904-1911

    This paper proposes a downlink multi-user transmission scheme for the amplify-and-forward(AF)-based multi-relay cellular network, in which Tomlinson-Harashima precoding(TH precoding) and interference alignment(IA) are jointly applied. The whole process of transmission is divided into two phases: TH precoding is first performed at base-station(BS) to support the multiplexing of data streams transmitted to both mobile-stations(MS) and relay-stations(RS), and then IA is performed at both BS and RSs to achieve the interference-free communication. During the whole process, neither data exchange nor strict synchronization is required among BS and RSs thus reducing the cooperative complexity as well as improving the system performance. Theoretical analysis is provided with respect to the channel capacity of different types of users, resulting the upper-bounds of channel capacity. Our analysis and simulation results show that the joint applications of TH precoding and IA outperforms other schemes in the presented multi-relay cellular network.

  • Constructions of Optimal (υ,{4,5,6},1,Q)-OOCs

    Xiyang LI  Pingzhi FAN  Dianhua WU  

     
    LETTER-Coding Theory

      Vol:
    E95-A No:3
      Page(s):
    669-672

    Optical code-division multiple-access (OCDMA) is a promising technique for multimedia transmission in fiber-optic local-area networks (LANs). Variable-weight optical orthogonal codes (OOCs) can be used for OCDMA networks supporting multiple quality of services (QoS). Most constructions for optimal variable-weight OOCs have focused on the case where the number of distinct Hamming weights of all codewords is equal to two, and the codewords of weight 3 are normally included. In this letter, four explicit constructions of optimal (υ,{4,5,6},1,Q)-OOCs are presented, and more new optimal (υ,{4,5,6},1,Q)-OOCs are obtained via recursive constructions. These improve the existing results on optimal variable-weight OOCs with at least three distinct Hamming weights and minimum Hamming weight 4.

  • FOREWORD

    Pingzhi FAN  Tetsuya KOJIMA  

     
    FOREWORD

      Vol:
    E101-A No:12
      Page(s):
    2327-2327
  • New Classes of Optimal Variable-Weight Optical Orthogonal Codes with Hamming Weights 3 and 4

    Xiyang LI  Pingzhi FAN  Naoki SUEHIRO  Dianhua WU  

     
    PAPER-Sequences

      Vol:
    E95-A No:11
      Page(s):
    1843-1850

    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.

  • Robust Linear Transmit/Receive Processing for Correlated MIMO Downlink with Imperfect CSI

    Hao LI  Changqing XU  Pingzhi FAN  

     
    PAPER-Communication Theory and Signals

      Vol:
    E91-A No:9
      Page(s):
    2626-2636

    In this paper we investigate designing optimal linear transmit/receive processing filters for multiuser MIMO downlinks with imperfect channel state information (CSI) and spatial fading correlation between antenna array at BS. A robust scheme is proposed to obtain the optimal linear transmit/receive filters in the sense of minimizing the average sum mean square error (SMSE) conditional on noisy channel estimates under a per-user transmit power constraint. Using an iterative procedure, the proposed scheme extends the existing optimization algorithm for uncorrelated single-user MIMO systems with perfect CSI to solve the problem of minimizing SMSE in spatially correlated MIMO downlinks with imperfect CSI. Comparing with non-robust scheme, we show that robust scheme efficiently mitigates the BER loss induced by imperfect CSI. In addition, the impact of fading correlation at BS on the performance of the proposed robust scheme is analyzed.

  • Downlink Transmission Scheme for Wireless MIMO Broadcast Channels with Multiuser Diversity

    Hao LI  Changqing XU  Pingzhi FAN  

     
    PAPER-Communication Theory and Signals

      Vol:
    E91-A No:8
      Page(s):
    2174-2182

    Sum power iterative water-filling (SPIWF) algorithm provides sum-rate-optimal transmission scheme for wireless multiple-input multiple-output (MIMO) broadcast channels (BC), whereas it suffers from its high complexity. In this paper, we propose a new transmission scheme based on a novel block zero-forcing dirty paper coding (Block ZF-DPC) strategy and multiuser-diversity-achieving user selection procedure. The Block ZF-DPC can be considered as an extension of existing ZF-DPC into MIMO BCs. Two user selection algorithms having linear increasing complexity with the number of users have been proposed. One aims at maximizing the achievable sum rate directly and the other is based on Gram-Schmidt Orthogonalization (GSO) and Frobenius norm. The proposed scheme is shown to achieve a sum rate close to the sum capacity of MIMO BC and obtain optimal multiplexing and multiuser diversity gain. In addition, we also show that both selection algorithms achieve a significant part of the sum rate of the optimal greedy selection algorithm at low computation expenditure.

  • A Novel SNR Estimation Technique Associated with Hybrid ARQ

    Qingchun CHEN  Pingzhi FAN  

     
    PAPER-Communication Theory and Signals

      Vol:
    E92-A No:11
      Page(s):
    2895-2909

    By using multiple repeated signal replicas to formulate the accumulative observed noisy signal sequence (AONSS) or the differential observed noisy signal sequence (DONSS) in the hybrid ARQ system, a novel data-aided maximum likelihood (DA ML) SNR estimation and a blind ML SNR estimation technique are proposed for the AWGN channel. It is revealed that the conventional DA ML estimate is a special case of the novel DA ML estimate, and both the proposed DA ML and the proposed blind ML SNR estimation techniques can offer satisfactory SNR estimation without introducing significant additional complexity to the existing hybrid ARQ scheme. Based on the AONSS, both the generalized deterministic and the random Cramer-Rao lower bounds (GCRLBs), which include the traditional Cramer-Rao lower bounds (CRLBs) as special cases, are also derived. Finally, the applicability of the proposed SNR estimation techniques based on the AONSS and the DONSS are validated through numerical analysis and simulation results.

  • FOREWORD

    Pingzhi FAN  Naoki SUEHIRO  

     
    FOREWORD

      Vol:
    E91-A No:12
      Page(s):
    3663-3664
  • FOREWORD

    Naoki SUEHIRO  Pingzhi FAN  

     
    FOREWORD

      Vol:
    E89-A No:9
      Page(s):
    2245-2246
  • FOREWORD Open Access

    Pingzhi FAN  Tetsuya KOJIMA  

     
    FOREWORD

      Vol:
    E106-A No:12
      Page(s):
    1450-1451
  • Hybrid Resource Allocation Scheme with Proportional Fairness in OFDMA-Based Cognitive Radio Systems

    Li LI  Changqing XU  Pingzhi FAN  Jian HE  

     
    LETTER-Communication Theory and Signals

      Vol:
    E95-A No:8
      Page(s):
    1430-1434

    In this paper, the resource allocation problem for proportional fairness in hybrid Cognitive Radio (CR) systems is studied. In OFDMA-based CR systems, traditional resource allocation algorithms can not guarantee proportional rates among CR users (CRU) in each OFDM symbol because the number of available subchannels might be smaller than that of CRUs in some OFDM symbols. To deal with this time-varying nature of available spectrum resource, a hybrid CR scheme in which CRUs are allowed to use subchannels in both spectrum holes and primary users (PU) bands is adopted and a resource allocation algorithm is proposed to guarantee proportional rates among CRUs with no undue interference to PUs.

1-20hit(28hit)