The search functionality is under construction.
The search functionality is under construction.

Keyword Search Result

[Keyword] Q(6809hit)

1181-1200hit(6809hit)

  • Iterative Optimal Design for Fast Filter Bank with Low Complexity

    Jinguang HAO  Wenjiang PEI  Kai WANG  Yili XIA  Cunlai PU  

     
    LETTER-Digital Signal Processing

      Vol:
    E99-A No:2
      Page(s):
    639-642

    In this paper, an iterative optimal method is proposed to design the prototype filters for a fast filter bank (FFB) with low complexity, aiming to control the optimum ripple magnitude tolerance of each filter according to the overall specifications. This problem is formulated as an optimization problem for which the total number of multiplications is to be minimized subject to the constrained ripple in the passband and stopband. In the following, an iterative solution is proposed to solve this optimization problem for the purpose of obtaining the impulse response coefficients with low complexity at each stage. Simulations are conducted to verify the performance of the proposed scheme and show that compared with the original method, the proposed scheme can reduce about 24.24% of multiplications. In addition, the proposed scheme and the original method provide similar mean square error (MSE) and the mean absolute error (MAE) of the frequency response.

  • Performance Evaluation of Virtualized LTE-EPC Data Plane with MPLS Core Using PPBP Machine-to-Machine Traffic

    Hussien M. HUSSIEN  Hussein A. ELSAYED  

     
    PAPER

      Vol:
    E99-B No:2
      Page(s):
    326-336

    3GPP Long Term Evolution (LTE) is one of the most advanced technologies in the wireless and mobility field because it provides high speed data and sophisticated applications. LTE was originally deployed by service providers on various platforms using separate dedicated hardware in Access radio layer and the Evolved Packet Core network layer (EPC), thereby limiting the system's flexibility and capacity provisioning. Thus, the concept of virtualization was introduced in the EPC hardware to solve the dedicated hardware platform limitations. It was also introduced in the IP Multimedia Subsystem (IMS) and Machine to Machine applications (M2M) for the same reason. This paper provides a simulation model of a virtualized EPC and virtualized M2M transport application server connected via an external IP network, which has significant importance in the future of mobile networks. This model studies the virtualized server connectivity problem, where two separate virtual machines communicate via the existing external legacy IP network. The simulation results show moderate performance, indicating that the selection of IP technology is much more critical than before. The paper also models MPLS technology as a replacement for the external IP routing mechanism to provide traffic engineering and achieve more efficient network performance. Furthermore, to provide a real network environment, Poisson Pareto Burst Process (PPBP) traffic source is carried over the UDP transport layer which matches the statistical properties of real-life M2M traffic. Furthermore, the paper proves End-to-End interoperability of LTE and MPLS running GTP and MPLS Label Forwarding information Base (LFIB) and MPLS traffic engineering respectively. Finally, it looks at the simulation of several scenarios using Network Simulator 3 (NS-3) to evaluate the performance improvement over the traditional LTE IP architecture under M2M traffic load.

  • On the Nonexistence of Almost Difference Sets Constructed from the Set of Octic Residues

    Minglong QI  Shengwu XIONG  Jingling YUAN  Wenbi RAO  Luo ZHONG  

     
    LETTER-Cryptography and Information Security

      Vol:
    E99-A No:2
      Page(s):
    666-673

    Pseudorandom binary sequences balanced and with optimal autocorrelation have many applications in the stream cipher, communication, coding theory, etc. Constructing a binary sequences with three-level autocorrelation is equivalent to finding the corresponding characteristic set of the sequences that should be an almost difference set. In the work of T.W. Cusick, C. Ding, and A. Renvall in 1998, the authors gave the necessary and sufficient conditions by which a set of octic residues modulo an odd prime forms an almost difference set. In this paper we show that no integers verify those conditions by the theory of generalized Pell equations. In addition, by relaxing the definition of almost difference set given by the same authors, we could construct two classes of modified almost difference sets and two ones of difference sets from the set of octic residues.

  • MIMO Doppler Radar Using Khatri-Rao Product Virtual Array for Indoor Human Detection

    Yosuke WAKAMATSU  Hiroyoshi YAMADA  Yoshio YAMAGUCHI  

     
    PAPER-Antennas and Propagation

      Vol:
    E99-B No:1
      Page(s):
    124-133

    The MIMO technique can improve system performance of not only communication system but also of radar systems. In this paper, we apply the MIMO radar with enhanced angular resolution to the indoor location estimation of humans. The Khatri-Rao (KR) matrix product is also adopted for further angular resolution enhancement. We show that the MIMO radar with the KR matrix product processing can increase the number of virtual elements effectively with suitable element arrangement, hence higher angular resolution can be realized. In general, the KR matrix product processing is not suitable for coherent radar because of signal correlation. However, when targets signals have enough Doppler frequency differential against each other, this approach works well because the signals are decorrelated. In addition, Doppler filtering is introduced to remove unwanted responses of stationary objects which make human detection difficult with conventional methods. Computer simulation and experimental results are provided to show performance of the proposed method.

  • Wideband Power Spectrum Sensing and Reconstruction Based on Single Channel Sub-Nyquist Sampling

    Weichao SUN  Zhitao HUANG  Fenghua WANG  Xiang WANG  Shaoyi XIE  

     
    PAPER

      Vol:
    E99-A No:1
      Page(s):
    167-176

    A major challenge in wideband spectrum sensing, in cognitive radio system for example, is the requirement of a high sampling rate which may exceed today's best analog-to-digital converters (ADCs) front-end bandwidths. Compressive sampling is an attractive way to reduce the sampling rate. The modulated wideband converter (MWC) proposed recently is one of the most successful compressive sampling hardware architectures, but it has high hardware complexity owing to its parallel channels structure. In this paper, we design a single channel sub-Nyquist sampling scheme to bring substantial savings in terms of not only sampling rate but also hardware complexity, and we also present a wideband power spectrum sensing and reconstruction method for bandlimited wide-sense stationary (WSS) signals. The total sampling rate is only one channel rate of the MWC's. We evaluate the performance of the sensing model by computing the probability of detecting signal occupancy in terms of the signal-to-noise ratio (SNR) and other practical parameters. Simulation results underline the promising performance of proposed approach.

  • Distance Estimation Based on Statistical Models of Received Signal Strength

    Masahiro FUJII  Yuma HIROTA  Hiroyuki HATANO  Atsushi ITO  Yu WATANABE  

     
    LETTER

      Vol:
    E99-A No:1
      Page(s):
    199-203

    In this letter, we propose a new distance estimation method based on statistical models of a Received Signal Strength (RSS) at the receiver. The conventional distance estimator estimates the distance between the transmitter and the receiver based on the statistical average of the RSS when the receiver obtains instantaneous RSS and an estimate of the hyperparameters which consists of the path loss exponent and so on. However, it is well-known that instantaneous RSS does not always correspond to the average RSS because the RSS varies in accordance with a statistical model. Although the statistical model has been introduced for the hyperparameters estimation and the localization system, the conventional distance estimator has not yet utilized it. We introduce the statistical model to the distance estimator whose expected value of the estimate corresponds to true distance. Our theoretical analysis establishes that the proposed distance estimator is preferable to the conventional one in order to improve accuracy in the expected value of the distance estimate. Moreover, we evaluate the Mean Square Error (MSE) between true distance and the estimate. We provide evidence that the MSE is always proportional to the square of the distance if the estimate of the hyperparameters is ideally obtained.

  • Sub-Band Noise Reduction in Multi-Channel Digital Hearing Aid

    Qingyun WANG  Ruiyu LIANG  Li JING  Cairong ZOU  Li ZHAO  

     
    LETTER-Speech and Hearing

      Pubricized:
    2015/10/14
      Vol:
    E99-D No:1
      Page(s):
    292-295

    Since digital hearing aids are sensitive to time delay and power consumption, the computational complexity of noise reduction must be reduced as much as possible. Therefore, some complicated algorithms based on the analysis of the time-frequency domain are very difficult to implement in digital hearing aids. This paper presents a new approach that yields an improved noise reduction algorithm with greatly reduce computational complexity for multi-channel digital hearing aids. First, the sub-band sound pressure level (SPL) is calculated in real time. Then, based on the calculated sub-band SPL, the noise in the sub-band is estimated and the possibility of speech is computed. Finally, a posteriori and a priori signal-to-noise ratios are estimated and the gain function is acquired to reduce the noise adaptively. By replacing the FFT and IFFT transforms by the known SPL, the proposed algorithm greatly reduces the computation loads. Experiments on a prototype digital hearing aid show that the time delay is decreased to nearly half that of the traditional adaptive Wiener filtering and spectral subtraction algorithms, but the SNR improvement and PESQ score are rather satisfied. Compared with modulation frequency-based noise reduction algorithm, which is used in many commercial digital hearing aids, the proposed algorithm achieves not only more than 5dB SNR improvement but also less time delay and power consumption.

  • An Image Quality Assessment Using Mean-Centered Weber Ratio and Saliency Map

    Soyoung CHUNG  Min Gyo CHUNG  

     
    LETTER

      Pubricized:
    2015/10/21
      Vol:
    E99-D No:1
      Page(s):
    138-140

    Chen proposed an image quality assessment method to evaluate image quality at a ratio of noise in an image. However, Chen's method had some drawbacks that unnoticeable noise is reflected in the evaluation or noise position is not accurately detected. Therefore, in this paper, we propose a new image quality measurement scheme using the mean-centered WLNI (Weber's Law Noise Identifier) and the saliency map. The experimental results show that the proposed method outperforms Chen's and agrees more consistently with human visual judgment.

  • Asymptotic Error Probability Analysis of DQPSK/DDQPSK over Nakagami-m Fading Channels

    Hoojin LEE  

     
    PAPER-Fundamental Theories for Communications

      Vol:
    E99-B No:1
      Page(s):
    152-156

    In this paper, we derive two simple asymptotic closed-form formulas for the average bit error probability (BEP) of differential quaternary phase shift keying (DQPSK) with Gray encoding and a simple asymptotic approximation for the average symbol error probability (SEP) of doubly-differential quaternary phase shift keying (DDQPSK) in Nakagami-m fading channels. Compared with the existing BEP/SEP expressions, the derived concise formulas are much more effective in evaluating the asymptotic properties of DQPSK/DDQPSK with various Nakagami fading parameters, the accuracy of which is verified by extensive numerical results.

  • Joint Tx/Rx MMSE Filtering for Single-Carrier MIMO Eigenmode Transmission Using Iterative Interference Cancellation

    Shinya KUMAGAI  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E99-B No:1
      Page(s):
    192-201

    In this paper, we propose a new joint transmit and receive spatial/frequency-domain filtering for single-carrier (SC) multiple-input multiple-output (MIMO) eigenmode transmission using iterative interference cancellation (IC). Iterative IC is introduced to a previously proposed joint transmit and receive spatial/frequency-domain filtering based on minimum mean square error criterion (called joint Tx/Rx MMSE filtering) to reduce the residual inter-symbol interference (ISI) after the Rx filtering. The optimal Tx/Rx filters are derived based on the MMSE criterion taking into account the iterative IC. The superiority of our proposed technique is confirmed by computer simulation.

  • Mutual Interference Suppression Using Clipping and Weighted-Envelope Normalization for Automotive FMCW Radar Systems

    Jung-Hwan CHOI  Han-Byul LEE  Ji-Won CHOI  Seong-Cheol KIM  

     
    PAPER-Sensing

      Vol:
    E99-B No:1
      Page(s):
    280-287

    With extensive use of automotive radars, mutual interference between radars has become a crucial issue, since it increases the noise floor in the frequency domain triggering frequent false alarms and unsafe decision. This paper introduces a mathematical model for a frequency-modulated continuous-wave (FMCW) radar in interfering environments. In addition, this paper proposes a time-domain interference suppression method to provide anti-interference capability regardless of the signal-to-interference ratio. Numerical results are presented to verify the performance of a 77GHz FMCW radar systme with the proposed method in interference-rich environments.

  • Frequency-Domain Uniform Asymptotic Solution for Scattered Field by a Coated Cylinder with a Thin Lossy Medium

    Keiji GOTO  Naokatsu SUMIKAWA  Ryo ASAI  Taweedej SANTIKUL  

     
    PAPER

      Vol:
    E99-C No:1
      Page(s):
    18-27

    A frequency-domain (FD) uniform asymptotic solution (FD-UAS) which is useful for engineering applications is newly derived for the two-dimensional scattered magnetic field by a coated conducting cylinder covered with a thin lossy medium. The FD-UAS is uniform in the sense that it remains valid within the transition region adjacent to the shadow boundary, and it smoothly connects a geometric optical ray (GO) solution and a geometrical theory of diffraction (GTD) solution exterior to the transition region, respectively. We assume that the thickness of a coating medium is thin as compared with one wavelength of a cylindrical wave radiated from a magnetic line source. This uniform asymptotic solution is represented by a combination of scattered field component solutions, namely, the GO solution composed of a direct GO (DGO) and a reflected GO, the extended uniform GTD (extended UTD) solution made up of a DGO and a pseudo surface diffracted ray (pseudo SD), the modified UTD solution representing SD series, and the GTD solution for a lowest order SD. The FD-UAS is valid for a source point and/or an observation point located either near the coating surface or in the far-zone. The effectiveness and usefulness of the FD-UAS presented here are confirmed by comparing with both the exact solution and the conventional UTD shadow region solution.

  • Estimating the Number of Nodes in WLANs to Improve Throughput and QoS

    Takumi SANADA  Xuejun TIAN  Takashi OKUDA  Tetsuo IDEGUCHI  

     
    PAPER

      Pubricized:
    2015/10/21
      Vol:
    E99-D No:1
      Page(s):
    10-20

    WLANs have become increasingly popular and widely deployed. The MAC protocol is one of the important technology of the WLAN and affects communication efficiency directly. In this paper, focusing on MAC protocol, we propose a novel protocol that network nodes dynamically optimize their backoff process to achieve high throughput while supporting satisfied QoS. A distributed MAC protocol has an advantage that no infrastructure such as access point is necessary. On the other hand, total throughput decreases heavily and cannot guarantee QoS under high traffic load, which needs to be improved. Through theoretical analysis, we find that the average idle interval can represent current network traffic load and can be used together with estimated number of nodes for setting optimal CW. Since necessary indexes can be obtained directly through observing channel, our scheme based on those indexes will not increase any added load to networks, which makes our schemes simpler and more effective. Through simulation comparison with conventional method, we show that our scheme can greatly enhance the throughput and the QoS no matter the network is in saturated or non-saturated case, while maintaining good fairness.

  • Unsupervised Learning of Continuous Density HMM for Variable-Length Spoken Unit Discovery

    Meng SUN  Hugo VAN HAMME  Yimin WANG  Xiongwei ZHANG  

     
    LETTER-Speech and Hearing

      Pubricized:
    2015/10/21
      Vol:
    E99-D No:1
      Page(s):
    296-299

    Unsupervised spoken unit discovery or zero-source speech recognition is an emerging research topic which is important for spoken document analysis of languages or dialects with little human annotation. In this paper, we extend our earlier joint training framework for unsupervised learning of discrete density HMM to continuous density HMM (CDHMM) and apply it to spoken unit discovery. In the proposed recipe, we first cluster a group of Gaussians which then act as initializations to the joint training framework of nonnegative matrix factorization and semi-continuous density HMM (SCDHMM). In SCDHMM, all the hidden states share the same group of Gaussians but with different mixture weights. A CDHMM is subsequently constructed by tying the top-N activated Gaussians to each hidden state. Baum-Welch training is finally conducted to update the parameters of the Gaussians, mixture weights and HMM transition probabilities. Experiments were conducted on word discovery from TIDIGITS and phone discovery from TIMIT. For TIDIGITS, units were modeled by 10 states which turn out to be strongly related to words; while for TIMIT, units were modeled by 3 states which are likely to be phonemes.

  • Pitch Determination from Bone Conducted Speech

    M. Shahidur RAHMAN  Tetsuya SHIMAMURA  

     
    LETTER-Speech and Hearing

      Pubricized:
    2015/10/01
      Vol:
    E99-D No:1
      Page(s):
    283-287

    This paper explores the potential of pitch determination from bone conducted (BC) speech. Pitch determination from normal air conducted (AC) speech signal can not attain the expected level of accuracy for every voice and background conditions. In contrast, since BC speech is caused by the vibrations that have traveled through the vocal tract wall, it is robust against ambient conditions. Though an appropriate model of BC speech is not known, it has regular harmonic structure in the lower spectral region. Due to this lowpass nature, pitch determination from BC speech is not usually affected by the dominant first formant. Experiments conducted on simultaneously recorded AC and BC speech show that BC speech is more reliable for pitch estimation than AC speech. With little human work, pitch contour estimated from BC speech can also be used as pitch reference that can serve as an alternate to the pitch contour extracted from laryngograph output which is sometimes inconsistent with simultaneously recorded AC speech.

  • Model-Based Compressive Sensing Applied to Landmine Detection by GPR Open Access

    Riafeni KARLINA  Motoyuki SATO  

     
    PAPER

      Vol:
    E99-C No:1
      Page(s):
    44-51

    We propose an effective technique for estimation of targets by ground penetrating radar (GPR) using model-based compressive sensing (CS). We demonstrate the technique's performance by applying it to detection of buried landmines. The conventional CS algorithm enables the reconstruction of sparse subsurface images using much reduced measurement by exploiting its sparsity. However, for landmine detection purposes, CS faces some challenges because the landmine is not exactly a point target and also faces high level clutter from the propagation in the medium. By exploiting the physical characteristics of the landmine using model-based CS, the probability of landmine detection can be increased. Using a small pixel size, the landmine reflection in the image is represented by several pixels grouped in a three dimensional plane. This block structure can be used in the model based CS processing for imaging the buried landmine. The evaluation using laboratory data and datasets obtained from an actual mine field in Cambodia shows that the model-based CS gives better reconstruction of landmine images than conventional CS.

  • Electromagnetic Scattering Analysis from Rectangular Dielectric Cuboids - TE Polarization -

    An Ngoc NGUYEN  Hiroshi SHIRAI  

     
    PAPER

      Vol:
    E99-C No:1
      Page(s):
    11-17

    A high frequency approximation method is proposed to obtain the scattering from rectangular dielectric cuboids. Our formulation is based on a Kirchhoff type aperture integration of the equivalent current sources over the surface of the scattering bodies. The derived formulae have been used to get the radar cross section of cuboids, and the results are compared with those by other methods, such as physical optics, geometrical theory of diffraction, the HFSS simulation and measurements. Good agreement has been observed to confirm the validity of our method.

  • Joint Blind Compensation of Inter-Block Interference and Frequency-Dependent IQ Imbalance

    Xi ZHANG  Teruyuki MIYAJIMA  

     
    LETTER

      Vol:
    E99-A No:1
      Page(s):
    196-198

    In this letter, we propose a blind adaptive algorithm for joint compensation of inter-block interference (IBI) and frequency-dependent IQ imbalance using a single time-domain equalizer. We combine the MERRY algorithm for IBI suppression with the differential constant modulus algorithm to compensate for IQ imbalance. The effectiveness of the proposed algorithm is shown through computer simulations.

  • Efficient Weak Signals Acquisition Strategy for GNSS Receivers

    Weijun LU  Yanbin ZHANG  Dengyun LEI  Dunshan YU  

     
    PAPER-Navigation, Guidance and Control Systems

      Vol:
    E99-B No:1
      Page(s):
    288-295

    The key factors in overcoming for weak global navigation satellite systems (GNSS) signal acquisition are sensitivity and dwell time. In the conventional MAX/TC criteria, a preset threshold value is used to determine whether the signal exists. Thus the threshold is calculated carefully to balance the sensitivity and the dwell time. Affected by various environment noise and interference, the acquisition circuit will enter verifying mode frequently to eliminate false alarms, which will extend the mean acquisition time (MAT). Based on the periodicity of spread spectrum code in GNSS, this paper presents an improved double-dwell scheme that uses no threshold in detecting weak GNSS signals. By adopting this method, the acquisition performance of weak signal is significantly improved. Theoretical analysis and numerical simulation are presented detailed. Compared with the conventional MAX/TC criteria, the proposed method achieves improved performance in terms of detection probability and false alarm rate. Furthermore, the MAT decreases 15s when C/N0 is above 20dB-Hz. This can enhance the receiver sensitivity and shorten the time to first fix (TTFF).

  • Cryptanalysis of the Multivariate Signature Scheme Proposed in PQCrypto 2013

    Yasufumi HASHIMOTO  

     
    PAPER

      Vol:
    E99-A No:1
      Page(s):
    58-65

    In PQCrypto 2013, Yasuda, Takagi and Sakurai proposed a new signature scheme as one of multivariate public key cryptosystems (MPKCs). This scheme (called YTS) is based on the fact that there are two isometry classes of non-degenerate quadratic forms on a vector space with a prescribed dimension. The advantage of YTS is its efficiency. In fact, its signature generation is eight or nine times faster than Rainbow of similar size. For the security, it is known that the direct attack, the IP attack and the min-rank attack are applicable on YTS, and the running times are exponential time for the first and the second attacks and sub-exponential time for the third attack. In the present paper, we give a new attack on YTS whose approach is to use the diagonalization of matrices. Our attack works in polynomial time and it actually recovers equivalent secret keys of YTS having 140-bits security against min-rank attack in around fifteen seconds.

1181-1200hit(6809hit)