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

Keyword Search Result

[Keyword] (42807hit)

13001-13020hit(42807hit)

  • PSD Map Construction Scheme Based on Compressive Sensing in Cognitive Radio Networks

    Javad Afshar JAHANSHAHI  Mohammad ESLAMI  Seyed Ali GHORASHI  

     
    PAPER

      Vol:
    E95-B No:4
      Page(s):
    1056-1065

    of late, many researchers have been interested in sparse representation of signals and its applications such as Compressive Sensing in Cognitive Radio (CR) networks as a way of overcoming the issue of limited bandwidth. Compressive sensing based wideband spectrum sensing is a novel approach in cognitive radio systems. Also in these systems, using spatial-frequency opportunistic reuse is emerged interestingly by constructing and deploying spatial-frequency Power Spectral Density (PSD) maps. Since the CR sensors are distributed in the region of support, the sensed PSD by each sensor should be transmitted to a master node (base-station) in order to construct the PSD maps in space and frequency domains. When the number of sensors is large, this data transmission which is required for construction of PSD map can be challenging. In this paper, in order to transmit the CR sensors' data to the master node, the compressive sensing based scheme is used. Therefore, the measurements are sampled in a lower sampling rate than of the Nyquist rate. By using the proposed method, an acceptable PSD map for cognitive radio purposes can be achieved by only 30% of full data transmission. Also, simulation results show the robustness of the proposed method against the channel variations in comparison with classical methods. Different solution schemes such as Basis Pursuit, Lasso, Lars and Orthogonal Matching Pursuit are used and the quality performance of them is evaluated by several simulation results over a Rician channel with respect to several different compression and Signal to Noise Ratios. It is also illustrated that the performance of Basis Pursuit and Lasso methods outperform the other compression methods particularly in higher compression rates.

  • Layered Video Transmission with Network Coding in a Cooperative Virtual MIMO Cellular Relay Networks

    Yo-Han KIM  Jisun YOON  Jitae SHIN  Janghoon YANG  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:4
      Page(s):
    1451-1454

    In this letter, we propose a layered video streaming technique that combines network coding (NC), multiple-input multiple-output (MIMO), and hierarchical modulation (HM) over cellular relay networks. We provide a performance analysis of different transmission modes of NC and MIMO in terms of the error rate in video layers, which is reflected in the total layered-video quality. The HM is used to differentiate the error rates among video layers. The simulation results show that the NC, the MIMO spatial multiplexing (SM), and the combination of both the NC and MIMO-SM gives video-quality gains of about 1.9 dB, 6 dB, and 12 dB maximally, respectively, compared to the conventional single-input and single-output (SISO) single relay network (SRN) system.

  • A Reduced Complexity Linear QC-LDPC Encoding with Parity Vector Correction Technique

    Chanho YOON  Hoojin LEE  Joonhyuk KANG  

     
    LETTER-Fundamental Theories for Communications

      Vol:
    E95-B No:4
      Page(s):
    1402-1405

    A new approach for encoding one class of quasi-cyclic low-density parity-check (QC-LDPC) codes is proposed. The proposed encoding method is applicable to parity-check matrices having dual-diagonal parity structure with single column of weight three in the parity generation region. Instead of finding the parity bits directly, the proposed method finds parity bits through vector correction. While the proposed LDPC encoding scheme is readily applicable to matrices defined in the IEEE physical layer standards, the computational complexity of the post processing operation for extraction of correction vector requires less effort than solving the linear equations involved with finding the parity bit as proposed by Myung et al.

  • Efficient Antenna Selection for Amplify-and-Forward Two-Way MIMO Relay Systems

    Ming DING  Jun ZOU  Zeng YANG  Hanwen LUO  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:4
      Page(s):
    1459-1462

    In this letter, we propose an efficient relay antenna selection algorithm for the amplify and forward (AF) two-way multiple-input multiple-output (MIMO) relay systems with analogue network coding (ANC). The proposed algorithm greedily selects the additional receive-transmit antenna pair that provides the maximum sum-rate. An iterative computation method is also designed to evaluate the sum-rate efficiently.

  • A Distant Multipath Routing Method for Reliable Wireless Multi-Hop Data Transmission

    Kento TERAI  Daisuke ANZAI  Kyesan LEE  Kentaro YANAGIHARA  Shinsuke HARA  

     
    PAPER

      Vol:
    E95-A No:4
      Page(s):
    723-734

    In a wireless multi-hop network between a source node (S) and a destination node (D), multipath routing in which S redundantly sends the same packets to D through multiple routes at the same time is effective for enhancing the reliability of the wireless data transmission by means of route diversity. However, when applying the multipath routing to a factory where huge robots are moving around, if closer multiple routes are selected, the probability that they are blocked by the robots at the same time becomes higher, so the reliability in terms of packet loss rate cannot be enhanced. In this paper, we propose a multipath routing method which can select physically distant multiple routes without any knowledge on the locations of nodes. We introduce a single metric composed of “the distance between routes” and “the route quality” by means of scalarization in multi-objective maximization problem and apply a genetic algorithm (GA) for searching for adequate routes which maximize the metric. Computer simulation results show that the proposed method can adaptively control the topologies of selected routes between S and D, and effectively reduce the packet loss rates.

  • A Connected Dominating Set Based Fast Decentralized Cooperative Sensing Algorithm for Cognitive Radio Networks

    Qihui WU  Yuhua XU  Zhiyong DU  Jinlong WANG  Alagan ANPALAGAN  

     
    LETTER

      Vol:
    E95-B No:4
      Page(s):
    1291-1294

    This letter proposes a novel connected dominanting set based decentralized cooperative spectrum sensing algorithm for cognitive radio networks. It is analytically shown that the proposed algorithm distributively converges to the average consensus as that of traditional distributed consensus algorithm, while reducing both the convergence time and message complexity significantly.

  • Exact Error Performance Analysis of Arbitrary 2-D Modulation OFDM Systems with Carrier Frequency Offset

    Jaeyoon LEE  Dongweon YOON  Hoon YOO  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:4
      Page(s):
    1439-1442

    In an orthogonal frequency division multiplexing (OFDM) system, carrier frequency offset (CFO) causes intercarrier interference (ICI) which significantly degrades the system error performance. In this paper we provide a closed-form expression to evaluate the exact error probabilities of arbitrary 2-D modulation OFDM systems with CFO, and analyze the effect of CFO on error performance.

  • Distributed Spatial Interference Coordination for IEEE 802.11n Wireless Networks

    Rui CHEN  Changle LI  Jiandong LI  

     
    LETTER

      Vol:
    E95-B No:4
      Page(s):
    1297-1299

    The 802.11n networks with MIMO technique provide a spatial degree of freedom for dealing with co-channel interference. In this letter, our proposed spatial interference coordination scheme is achieved by distributed precoding for the downlink and distributed multi-user detection for the uplink. Simulation results validate the proposed scheme in terms of the downlink and uplink maximum achievable rates at each AP.

  • Impact Analysis on an Attributed Goal Graph

    Shinpei HAYASHI  Daisuke TANABE  Haruhiko KAIYA  Motoshi SAEKI  

     
    PAPER

      Vol:
    E95-D No:4
      Page(s):
    1012-1020

    Requirements changes frequently occur at any time of a software development process, and their management is a crucial issue to develop software of high quality. Meanwhile, goal-oriented analysis techniques are being put into practice to elicit requirements. In this situation, the change management of goal graphs and its support are necessary. This paper presents a technique related to the change management of goal graphs, realizing impact analysis on a goal graph when its modifications occur. Our impact analysis detects conflicts that arise when a new goal is added, and investigates the achievability of the other goals when an existing goal is deleted. We have implemented a supporting tool for automating the analysis. Two case studies suggested the efficiency of the proposed approach.

  • Sensing Methods for Detecting Analog Television Signals

    Mohammad Azizur RAHMAN  Chunyi SONG  Hiroshi HARADA  

     
    PAPER

      Vol:
    E95-B No:4
      Page(s):
    1066-1075

    This paper introduces a unified method of spectrum sensing for all existing analog television (TV) signals including NTSC, PAL and SECAM. We propose a correlation based method (CBM) with a single reference signal for sensing any analog TV signals. In addition we also propose an improved energy detection method. The CBM approach has been implemented in a hardware prototype specially designed for participating in Singapore TV white space (WS) test trial conducted by Infocomm Development Authority (IDA) of the Singapore government. Analytical and simulation results of the CBM method will be presented in the paper, as well as hardware testing results for sensing various analog TV signals. Both AWGN and fading channels will be considered. It is shown that the theoretical results closely match with those from simulations. Sensing performance of the hardware prototype will also be presented in fading environment by using a fading simulator. We present performance of the proposed techniques in terms of probability of false alarm, probability of detection, sensing time etc. We also present a comparative study of the various techniques.

  • A Chaos MIMO Transmission Scheme for Channel Coding and Physical-Layer Security

    Eiji OKAMOTO  

     
    PAPER-Wireless Communication Technologies

      Vol:
    E95-B No:4
      Page(s):
    1384-1392

    In recent wireless communication systems, security is ensured mainly in the upper-layer techniques such as a password or a cryptography processing. However, security needs not be restricted to the upper-layer and the addition of physical-layer security also would yield a much more robust system. Therefore, in this paper, we exploit chaos communication and propose a chaos multiple-input multiple-output (MIMO) transmission scheme which achieves physical-layer security and additional channel-coding gain. A chaotic modulation symbol is multiplied to the data to be transmitted at each MIMO antenna to exploit the MIMO antenna diversity, and at the receiver, the joint MIMO detection and chaos decoding is done by maximum likelihood decoding (MLD). The conventional chaos modulation suffers from bit error rate (BER) performance degradation, while the coding gain is obtained in the proposed scheme by the chaos modulation in MIMO. We evaluate the performances of the proposed scheme by an analysis and computer simulations.

  • FOREWORD

    Ryuji KOHNO  

     
    FOREWORD

      Vol:
    E95-A No:4
      Page(s):
    679-679
  • FOREWORD Open Access

    Mutsuo HIDAKA  

     
    FOREWORD

      Vol:
    E95-C No:3
      Page(s):
    319-319
  • An Enhanced Observed Time Difference of Arrival Based Positioning Method for 3GPP LTE System

    Kyung-Hoon WON  Jun-Hee JANG  Hyung-Jin CHOI  

     
    PAPER-Sensing

      Vol:
    E95-B No:3
      Page(s):
    961-971

    In 3GPP (3-rd Generation Partnership Project) LTE (Long Term Evolution) system, the use of PRS (Positioning Reference Signal) for OTDOA (Observed Time Difference of Arrival) based positioning method has been agreed. However, PRSs can be overlapped at the receiver side in synchronous network because the frequency shift pattern of PRS is decided by cell ID (Identity). Moreover, in asynchronous network, the loss of orthogonality between received PRSs generates continuous interferences. Even though autonomous muting can be applied to solve the interference problems in synchronous and asynchronous networks, the muting scheme degrades the overall positioning efficiency and requires additional network complexity. Therefore, in this paper, we propose novel OTDOA based positioning methods at the receiver side to improve positioning efficiency: cancellation method of serving PRS for synchronous network, TDORS (Time Domain Orthogonal Reference Signal) generation and useful CIR (Channel Impulse Response) selection methods for asynchronous network. We verified that the proposed methods can achieve an accurate estimation and stable operation without PRS muting.

  • JTAR: Junction-Based Traffic Aware Routing in Sparse Urban VANETs

    Haifeng SUN  Guangchun LUO  Hao CHEN  

     
    LETTER-Network

      Vol:
    E95-B No:3
      Page(s):
    1007-1010

    We propose a Junction-Based Traffic Aware Routing (JTAR) protocol for Vehicular Ad Hoc Networks (VANETs) in sparse urban environments. A traffic aware optimum junction selection solution is adopted in packet-forwarding, and a metric named critical-segment is defined in recovery strategy. Simulation results show that JTAR can efficiently increase the packet delivery ratio and reduce the delivery delay.

  • Estimation of Transit Time in Terahertz Oscillating Resonant Tunneling Diodes with Graded Emitter and Thin Barriers

    Atsushi TERANISHI  Safumi SUZUKI  Kaoru SHIZUNO  Masahiro ASADA  Hiroki SUGIYAMA  Haruki YOKOYAMA  

     
    PAPER-Semiconductor Materials and Devices

      Vol:
    E95-C No:3
      Page(s):
    401-407

    We estimated the transit time of GaInAs/AlAs double-barrier resonant tunneling diodes (RTDs) oscillating at 0.6–1 THz. The RTDs have graded emitter structures and thin barriers, and are integrated with planar slot antennas for the oscillation. The transit time across the collector depletion region was estimated from measured results of the dependence of oscillation frequency on RTD mesa area. The estimated transit time was slightly reduced with the introduction of the graded emitter, probably due to reduction of the electron transition between Γ and L bands resulted from the low electric field in the collector depletion region.

  • Solving SAT and Hamiltonian Cycle Problem Using Asynchronous P Systems

    Hirofumi TAGAWA  Akihiro FUJIWARA  

     
    PAPER

      Vol:
    E95-D No:3
      Page(s):
    746-754

    In the present paper, we consider fully asynchronous parallelism in membrane computing, and propose two asynchronous P systems for the satisfiability (SAT) and Hamiltonian cycle problem. We first propose an asynchronous P system that solves SAT with n variables and m clauses, and show that the proposed P system computes SAT in O(mn2n) sequential steps or O(mn) parallel steps using O(mn) kinds of objects. We next propose an asynchronous P system that solves the Hamiltonian cycle problem with n nodes, and show that the proposed P system computes the problem in O(n!) sequential steps or O(n2) parallel steps using O(n2) kinds of objects.

  • A Frequency Offset Estimation and Compensation Scheme for MB-OFDM UWB Modem

    Do-Hoon KIM  Kyu-Min KANG  Chungyong LEE  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:3
      Page(s):
    1015-1018

    We present a carrier and sampling frequency offset estimation and compensation scheme for a multi-band orthogonal frequency division multiplexing (MB-OFDM) ultra-wideband (UWB) modem. We first perform initial carrier frequency offset (CFO) estimation and compensation during the preamble period, and then conduct the estimation and compensation of the residual CFO and sampling frequency offset (SFO) during the payload period. The proposed design scheme reduces the logic gate count of the frequency offset compensation block by about 10%, while it gives almost the same performance at the packet error rate (PER) of 10-4 in the CM1 channel. The frequency offset estimation and compensation block is implemented using 90 nm CMOS technology and tested.

  • The Impact of Disjoint Multiple Paths on SCTP in the Connected MANET for Emergency Situations

    Jeongseo PARK  Jinsoo CHO  Taekeun PARK  

     
    LETTER-Internet

      Vol:
    E95-B No:3
      Page(s):
    1011-1014

    In this letter, we investigate the performance impact of disjoint multiple paths on SCTP in the connected MANET under emergency situations. Disjoint multiple paths allow multi-homing of SCTP to be fully utilized in MANETs, but it may cause inappropriate SACK handling. Through simulations, we evaluate the impact in terms of throughput and energy efficiency.

  • Joint Mode Selection and Resource Allocation for Cellular Controlled Short-Range Communication in OFDMA Networks

    Hui DENG  Xiaoming TAO  Ning GE  Jianhua LU  

     
    LETTER-Wireless Communication Technologies

      Vol:
    E95-B No:3
      Page(s):
    1023-1026

    This letter studies cellular controlled short-range communication in OFDMA networks. The network needs to decide when to allow direct communication between a closely located device-to-device (D2D) pair instead of conveying data from one device to the other via the base station and when not to, in addition to subchannel and power allocation. Our goal is to maximize the total network throughput while guaranteeing the rate requirements of all users. For that purpose, we formulate an optimization problem subject to subchannel and power constraints. A scheme which combines a joint mode selection and subchannel allocation algorithm based on equal power allocation with a power reallocation scheme is proposed. Simulation results show that our proposed scheme can improve the network throughput and outage probability compared with other schemes.

13001-13020hit(42807hit)