The search functionality is under construction.

IEICE TRANSACTIONS on Communications

  • Impact Factor

    0.72

  • Eigenfactor

    0.002

  • article influence

    0.1

  • Cite Score

    1.6

Advance publication (published online immediately after acceptance)

Volume E94-B No.12  (Publication Date:2011/12/01)

    Special Section on Cooperative Communications for Cellular Networks
  • FOREWORD Open Access

    Katsuhiko HIRAMATSU  

     
    FOREWORD

      Page(s):
    3201-3201
  • Radio Interface Technologies for Cooperative Transmission in 3GPP LTE-Advanced Open Access

    Tetsushi ABE  Yoshihisa KISHIYAMA  Yoshikazu KAKURA  Daichi IMAMURA  

     
    INVITED PAPER

      Page(s):
    3202-3210

    This paper presents an overview of radio interface technologies for cooperative transmission in 3GPP LTE-Advanced, i.e., coordinated multi-point (CoMP) transmission, enhanced inter-cell interference coordination (eICIC) for heterogeneous deployments, and relay transmission techniques. This paper covers not only the technical components in the 3GPP specifications that have already been released, but also those that were discussed in the Study Item phase of LTE-Advanced, and those that are currently being discussed in 3GPP for potential specification in future LTE releases.

  • Uplink Coordinated Multi-Point ARQ in MIMO Cellular Systems Open Access

    Tony Q. S. QUEK  Kampol WORADIT  Hyundong SHIN  Zander LEI  

     
    INVITED PAPER

      Page(s):
    3211-3224

    Coordinated multi-point processing at multiple base stations can improve coverage, system throughput, and cell-edge throughput for future cellular systems. In this paper, we study the coordinated reception of transmitted signals at multiple MIMO base stations to exploit cooperative diversity. In particular, we propose to employ cooperative multicell automatic repeat request (ARQ) protocol via backhaul links. The attractiveness of this protocol is that processing between coordinated base stations can be made completely transparent to the mobile user, and it improves the mobile user's link reliability and throughput significantly compared to noncooperative ARQ protocol. In our proposed protocol, we consider the scenario where the multicell processing involves one of the following three schemes: decode-and-forward, amplify-and-forward, and compress-and-forward schemes. We derive the average packet error rate and throughput for these cooperative multicell ARQ protocols. Numerical results show that the cooperative multicell ARQ protocols are promising in terms of average packet error rate and throughput. Furthermore, we show that the degree of improvement depends on the type of cooperative multicell ARQ protocol employed and the operating average signal-to-noise ratio of the main and backhaul links.

  • Distributed Cooperative Multicell Beamforming Based on a Viewpoint of Layered Channel

    Jiamin LI  Dongming WANG  Pengcheng ZHU  Lan TANG  Xiaohu YOU  

     
    PAPER

      Page(s):
    3225-3231

    In this paper, a distributed cooperative multicell beamforming algorithm is proposed, and a detail analysis and solving method for instantaneous and statistical channel state information (CSI) are presented. Firstly, an improved distributed iterative beamforming algorithm is proposed for the multiple-input single-output interference channel (MISO IC) scenario which chooses virtual signal-to-interference-and-noise (SINR) as decision criterion to initialize and then iteratively solves the constrained optimization problem of maximizing the virtual SINR for a given level of generated interference to other users. Then, the algorithm is generalized to the multicell date sharing scenario with a heuristics power allocation scheme based on a viewpoint of the layered channel. Finally, the performance is illustrated through numerical simulations.

  • Adaptive Spatial Other Cell Interference Cancelation for Multiuser Multi-Cell Cooperating System

    Jin-Hee LEE  Young-Chai KO  

     
    PAPER

      Page(s):
    3232-3238

    In multi-cell wireless systems with insufficient frequency reuse, the downlink transmission suffers from other cell interference (OCI). The cooperative transmission among multiple base stations is an effective way to mitigate OCI and increase the system sum rate. An adaptive scheme for serving one user in each cell was proposed in [1]. In this paper, we generalize the scheme in [1] by serving more than one user in each cell with adaptive OCI cancelation. Based on our derived statistics of a user for different transmission strategies, we propose a low complexity transmission scheme that achieves near-maximal ergodic sum rate. Through numerical examples, we show that the system sum rate can be improved by selecting the appropriate transmission strategy combination adaptively. As a result, our proposed system can explore spatial multiplexing gain without additional power and thus improves the system sum rate significantly.

  • A Low-Interference Relay Selection for Decode-and-Forward Cooperative Network in Underlay Cognitive Radio

    Chih-Wen (Wenson) CHANG  Po-Hsun LIN  

     
    PAPER

      Page(s):
    3239-3250

    In the underlay decode-and-forward (DaF) cooperative cognitive radio (CR) network, an optimal relay can be selected by the conventional max-min selection on the condition of not violating the interference temperature (IT) constraint. However, the max-min selection may cause some extra amount of interference to the primary system (PS) such that the so-called transfer ratio (TR) may be lower. Note that TR is newly defined as the ratio of the secondary system's (SS's) capacity gain to the PS's capacity loss due to the activities of SS. In order to improve the TR value, we are motivated by the pricing function in game theory to propose a novel low-interference relay selection by taking the impacts of the interference from SS to PS into consideration. Using the low-interference selection, however, it will not always allow the optimal relay to be picked. To clarify this phenomenon, the still optimal probability is defined as the probability of selecting the optimal relay by the proposed scheme. In addition, the impacts of the low-interference selection on the SS's capacity and outage probability are also analyzed. The simulation results prove that compared with the max-min selection, the proposed scheme can achieve higher TR values as well as the total capacity which also indicates that a higher spectrum efficiency can be achieved. It is believed that the results of this paper can provide an alternative viewpoint of evaluating the spectrum efficiency and inspire more interesting and important research topics in the future.

  • An Adaptive Weighted Clustering Algorithm for Cooperative Communications

    Qiyue YU  Weixiao MENG  Fumiyuki ADACHI  

     
    PAPER

      Page(s):
    3251-3258

    The cooperative relay network exploits the space diversity gain by allowing cooperation among users to improve transmission quality. It is an important issue to identify the cluster-head (or relay node) and its members who are to cooperate. The cluster-head consumes more battery power than an ordinary node since it has extra responsibilities, i.e., ensuring the cooperation of its members' transmissions; thereby the cluster-head has a lower throughput than the average. Since users are joining or departing the clusters from time to time, the network topology is changing and the network may not be stable. How to balance the fairness among users and the network stability is a very interesting topic. This paper proposes an adaptive weighted clustering algorithm (AWCA), in which the weight factors are introduced to adaptively control both the stability and fairness according to the number of arrival users. It is shown that when the number of arrival users is large, AWCA has the life time longer than FWCA and similar to SWCA and that when the number of arrival users is small, AWCA provides fairness higher than SWCA and close to FWCA.

  • Dynamic Fractional Base Station Cooperation Using Shared Distributed Remote Radio Units for Advanced Cellular Networks

    Naoki KUSASHIMA  Ian Dexter GARCIA  Kei SAKAGUCHI  Kiyomichi ARAKI  Shoji KANEKO  Yoji KISHI  

     
    PAPER

      Page(s):
    3259-3271

    Traditional cellular networks suffer the so-called “cell-edge problem” in which the user throughput is deteriorated because of pathloss and inter-cell (co-channel) interference. Recently, Base Station Cooperation (BSC) was proposed as a solution to the cell-edge problem by alleviating the interference and improving diversity and multiplexing gains at the cell-edge. However, it has minimal impact on cell-inner users and increases the complexity of the network. Moreover, static clustering, which fixes the cooperating cells, suffers from inter-cluster interference at the cluster-edge. In this paper, dynamic fractional cooperation is proposed to realize dynamic clustering in a shared RRU network. In the proposed algorithm, base station cooperation is performed dynamically at cell edges for throughput improvement of users located in these areas. To realize such base station cooperation in large scale cellular networks, coordinated scheduling and distributed dynamic cooperation are introduced. The introduction of coordinated scheduling in BSC multi-user MIMO not only maximizes the performance of BSC for cell-edge users but also reduces computational complexity by performing simple single-cell MIMO for cell-inner users. Furthermore, the proposed dynamic clustering employing shared RRU network realizes efficient transmission at all cell edges by forming cooperative cells dynamically with minimal network complexity. Owing to the combinations of the proposed algorithms, dynamic fractional cooperation achieves high network performance at all areas in the cellular network. Simulation results show that the cell-average and the 5% cell-edge user throughput can be significantly increased in practical cellular network scenarios.

  • Fairness-Aware Superposition Coded Scheduling for a Multi-User Cooperative Cellular System

    Megumi KANEKO  Kazunori HAYASHI  Petar POPOVSKI  Hideaki SAKAI  

     
    PAPER

      Page(s):
    3272-3279

    We consider Downlink (DL) scheduling for a multi-user cooperative cellular system with fixed relays. The conventional scheduling trend is to avoid interference by allocating orthogonal radio resources to each user, although simultaneous allocation of users on the same resource has been proven to be superior in, e.g., the broadcast channel. Therefore, we design a scheduler where in each frame, two selected relayed users are supported simultaneously through the Superposition Coding (SC) based scheme proposed in this paper. In this scheme, the messages destined to the two users are superposed in the modulation domain into three SC layers, allowing them to benefit from their high quality relayed links, thereby increasing the sum-rate. We derive the optimal power allocation over these three layers that maximizes the sum-rate under an equal rates' constraint. By integrating this scheme into the proposed scheduler, the simulation results show that our proposed SC scheduler provides high throughput and rate outage probability performance, indicating a significant fairness improvement. This validates the approach of simultaneous allocation versus orthogonal allocation in the cooperative cellular system.

  • Partially Non-orthogonal Block Diagonalization-Based Precoding in Downlink Multiuser MIMO with Limited Channel State Information Feedback

    Yuki TAJIKA  Hidekazu TAOKA  Kenichi HIGUCHI  

     
    PAPER

      Page(s):
    3280-3288

    This paper investigates a precoding method in downlink multiuser multiple-input multiple-output (MIMO) transmission with multiple base station (BS) cooperation, where each user device basically feeds back the instantaneous channel state information (CSI) to only the nearest BS, but the users near the cell edge additionally feedback the instantaneous CSI to the second nearest BS among the cooperating BSs. Our precoding method is categorized as a form of multi-cell processing (MCP) [5], in which the transmission information to a user is shared by the cooperating BSs in order to utilize fully the degrees of freedom of the spatial channel, and is based on block diagonalization of the channel matrix. However, since some elements of the channel matrix are unknown, we allow partially non-orthogonal transmission. More specifically, we allow inter-user interference to users with limited instantaneous CSI feedback from the channel where the instantaneous CSIs of those users are not obtained at the BSs. The other sources of inter-user interference are set to zero based on the block diagonalization of the channel matrix. The proposed method more efficiently utilizes the degrees of freedom of the spatial channel compared to the case with full orthogonal transmission at the cost of increased inter-user interference. Simulation results show the effectiveness of the proposed method compared to the conventional approaches, which can accommodate the partial CSI feedback scenario, from the viewpoints of the required transmission power and achievable throughput.

  • Frequency Offset Amplify-and-Forward Relay in OFDM System

    Ayana SUZUKI  Yukitoshi SANADA  Mamiko INAMORI  

     
    PAPER

      Page(s):
    3289-3295

    In the fourth generation mobile communication system, the frequency band higher than the bands already used for IMT-2000 has been assigned. However, the higher radio frequency increases the propagation loss. To cope with the propagation loss, relay transmission has been investigated. In this paper, a transmission diversity scheme with frequency offset in amplify-and-forward (AF) relaying is proposed. In this scheme, the frequency of the OFDM signal is shifted at the relay station. A different amount of frequency offset is given in each relay station and the signals from the relay stations are separated and combined by MMSE detection at the base station. The numerical results obtained through computer simulation show that diversity is realized and the BER performance is improved by 1-2 dB at the BER of 10-2. When the number of the RSs increases, more BER improvement is achieved.

  • System Performance Investigation of Layer-1 and Layer-3 Relays in LTE-Advanced Downlink

    Satoshi NAGATA  Yuan YAN  Anxin LI  Xinying GAO  Tetsushi ABE  Takehiro NAKAMURA  

     
    PAPER

      Page(s):
    3296-3303

    In Long-Term Evolution (LTE)-Advanced, an important goal in addition to achieving high-speed, high-capacity communications is throughput enhancement for cell-edge users. One solution is to relay radio transmissions between an eNode B and user equipment (UE). Relays are expected to extend the coverage to the cell boundary and coverage hole areas, and are expected to reduce network costs. It was agreed that in Release 10 LTE, a Layer-3 (L3) relay, which achieves self-backhauling of radio signals between an eNode B and a UE in Layer 3 should be standardized. Meanwhile, a Layer-1 (L1) relay, which amplifies and forwards received radio frequency signals, has already found widespread use in second-generation and third-generation mobile communication systems. This paper investigates the downlink system level performance for L3 and L1 relays with orthogonal frequency division multiple access (OFDMA) in LTE-Advanced. Various practical factors are taken into account in the evaluations such as the processing delay and upper bound of the amplifier gain of the L1 relay, capacity limitation of the backhaul channels, and empty buffer status at the L3 relay. We also propose and investigate a downlink backhaul link (radio link between the eNode B and L3 relay node) scheduling method for the in-band half-duplex L3 relay. In the proposed scheduling method, radio resources from an eNode B to an L3 relay node and macro UE are multiplexed in the same backhaul subframe considering the number of relay UEs and macro UEs, and the channel quality of the backhaul link to the L3 relay and the access link to the macro UE. Based on system-level simulations, we clarify the system impact of several conditions for the relay such as the number of relay nodes and the number of backhaul (radio link between eNode B and L3 relay) subframes, the distance between the eNode B and relay, and show the throughput performance gain of the L3 relay compared to the L1 relay. We also clarify that the cell-edge UE throughput performance is increased by approximately 10% by applying the proposed scheduling method due to more efficient and fair resource allocation to the L3 relay and macro UEs.

  • Performance Investigation on Cell Selection Schemes Associated with Downlink Inter-Cell Interference Coordination in Heterogeneous Networks for LTE-Advanced

    Yuya SAITO  Jaturong SANGIAMWONG  Nobuhiko MIKI  Satoshi NAGATA  Tetsushi ABE  Yukihiko OKUMURA  

     
    PAPER

      Page(s):
    3304-3311

    In Long-Term Evolution (LTE)-Advanced, a heterogeneous network in which femtocells and picocells overlay macrocells is being extensively discussed in addition to traditional well-planned macrocell deployment to improve further the system throughput. In heterogeneous network deployment, cell selection as well as inter-cell interference coordination (ICIC) is very important to improve the system and cell-edge throughput. Therefore, this paper investigates three cell selection methods associated with ICIC in heterogeneous networks in the LTE-Advanced downlink: Signal-to-interference plus noise power ratio (SINR)-based cell selection, reference signal received power (RSRP)-based cell selection, and reference signal received quality (RSRQ)-based cell selection. The results of simulations (4 picocells and 25 sets of user equipment are uniformly located within 1 macrocell) that assume a full buffer model show that the downlink cell and cell-edge user throughput levels of RSRP-based cell selection are degraded by approximately 2% and 11% compared to those for SINR-based cell selection under the condition of maximizing the cell-edge user throughput due to the impairment of the interference level. Furthermore, it is shown that the downlink cell-edge user throughput of RSRQ-based cell selection is improved by approximately 5%, although overall cell throughput is degraded by approximately 6% compared to that for SINR-based cell selection under the condition of maximizing the cell-edge user throughput.

  • Investigation on Downlink Control Channel Structure Using Cross-Carrier Scheduling for Carrier Aggregation-Based Heterogeneous Network in LTE-Advanced

    Nobuhiko MIKI  Anxin LI  Kazuaki TAKEDA  Yuan YAN  Hidetoshi KAYAMA  

     
    PAPER

      Page(s):
    3312-3320

    Carrier aggregation (CA) is one of the most important techniques for LTE-Advanced because of its capability to support a wide transmission bandwidth of up to 100 MHz and heterogeneous networks effectively while achieving backward compatibility with the Release 8 LTE. In order to improve the performance of control information transmission in heterogeneous networks, cross-carrier scheduling is supported, i.e., control information on one component carrier (CC) can assign radio resources on another CC. To convey the control information efficiently, a search space is defined and used in Release 8 LTE. In cross-carrier scheduling, the optimum design for the search space for different CCs is a paramount issue. This paper presents two novel methods for search space design. In the first method using one hash function, a user equipment (UE)-specific offset is introduced among search spaces associated with different CCs. Due to the UE-specific offsets, search spaces of different UEs are staggered and the probability that the search space of one UE is totally overlapped by that of another UE can be greatly reduced. In the second method using multiple hash functions, a novel randomization scheme is proposed to generate independent hash functions for search spaces of different CCs. Because of the perfect randomization effect of the proposed method, search space overlapping of different UEs is reduced. Simulation results show that both the proposed methods effectively reduce the blocking probability of the control information compared to existing methods.

  • Investigation on Data Signal Muting to Improve Channel Estimation Accuracy in Downlink Coordinated Multiple-Point Transmission in LTE-Advanced

    Yusuke OHWATARI  Nobuhiko MIKI  Tetsushi ABE  Satoshi NAGATA  Yukihiko OKUMURA  

     
    PAPER

      Page(s):
    3321-3334

    Accurate channel estimation for multiple cells is essential in downlink coordinated multi-point (CoMP) transmission/reception. Therefore, this paper investigates a technique to improve the channel estimation for downlink CoMP in Long-Term Evolution (LTE)-Advanced. In particular, the performance of data signal muting, i.e., muting data signals that collide with the channel state information reference signal (CSI-RS) of a neighboring cell, is evaluated considering various CoMP schemes and intra-eNodeB and inter-eNodeB CoMP scenarios. In a multi-cell link level simulation, coordinated scheduling and coordinated beamforming (CS/CB) CoMP is employed. The simulation results show that data signal muting is effective in improving the channel estimation accuracy, which is confirmed by numerical analysis. Simulation results also show that it is effective in improving the throughput performance, especially for sets of user equipment at the cell boundary. Furthermore, the tradeoff relationship between accurate channel estimation by muting larger numbers of data signals and a high peak data rate, i.e., low overhead, is investigated. It is shown that when the number of coordinated cells is set to three, the CSI-RS reuse factor is set to three, and the well-planned CSI-RS pattern allocation is employed, the improvement in performance is almost saturated in a synchronized network.

  • Investigation on Signaling Overhead for Mobility Management with Carrier Aggregation in LTE-Advanced

    Kengo YAGYU  Takeshi NAKAMORI  Hiroyuki ISHII  Mikio IWAMURA  Nobuhiko MIKI  Takahiro ASAI  Junichiro HAGIWARA  

     
    PAPER

      Page(s):
    3335-3345

    In Long-Term Evolution-Advanced (LTE-A), which is currently in the process of standardization in the 3rd generation partnership project (3GPP), carrier aggregation (CA) was introduced as a main feature for bandwidth extension while maintaining backward compatibility with LTE Release 8 (Rel. 8). In the CA mode of operation, since two or more component carriers (CCs), each of which is compatible with LTE Rel. 8, are aggregated, mobility management is needed for CCs such as inter/intra-frequency handover, CC addition, and CC removal to provide sufficient coverage and better overall signal quality. Therefore, the signaling overhead for Radio Resource Control (RRC) reconfiguration for the mobility management of CCs in LTE-A is expected to be larger than that in LTE Rel. 8. In addition, CA allows aggregation of cells with different types of coverage. Therefore, the signaling overhead may be dependent on the coverage of each CC assumed in a CA deployment scenario. Furthermore, especially in a picocell-overlaid scenario, the amount of signaling overhead may be different according to whether the aggregation of CCs between a macrocell and a picocell, i.e., transmission and reception from multiple sites, is allowed or not. Therefore, this paper investigates the CC control overhead with several CC management policies in some CA deployment scenarios, including a scenario with overlaid picocells. Simulation results show that the control overhead is almost the same irrespective of the different management policies, when almost the same coverage is provided for the CCs. In addition, it is shown that the increase in the control overhead is not significant even in a CA deployment scenario with overlaid picocells. We also show that the amount of signaling overhead in a picocell-overlaid scenario with the CA between a macrocell and a picocell is almost twice as that without the CA between a macrocell and a picocell.

  • Reference Signal Transmission Schemes for Coordinated Multi-Point Transmission for 3GPP LTE-Advanced

    Masayuki HOSHINO  Tadashi YOSHIDA  Daichi IMAMURA  

     
    PAPER

      Page(s):
    3346-3353

    In this study, we investigate reference signal (RS) transmission schemes that aim to efficiently support coordinated multi-point (CoMP) transmission by providing improved channel estimation accuracy so that transmission parameters can be appropriately chosen on a cellular network. First, we investigate typical scenarios for transmission parameter selection with the widely used CoMP transmission and precoding schemes aligned with those considered for Long Term Evolution (LTE)-Advanced systems. Second, we investigate an RS transmission scheme that can provide accurate channel estimation even with severe inter-cell interference. Finally, we verify the performance benefit of the investigated scheme by a multi-cell link level evaluation. The results obtained indicate: 1) the investigated scheme improves block error rate performance compared to conventional schemes for fixed modulation and coding schemes (MCSs) allocation with a better precoding control accuracy on the LTE-Advanced system downlink and 2) the investigated scheme provides a throughput performance gain compared to conventional schemes for adaptive MCS allocation and coordinated beamforming.

  • Demodulation Reference Signal Using Two-Dimensional Orthogonal Cover Code Mapping for Multi-Antenna/Point Transmission in LTE-Advanced Downlink

    Kazuaki TAKEDA  Yoshihisa KISHIYAMA  Tetsushi ABE  Takehiro NAKAMURA  

     
    PAPER

      Page(s):
    3354-3361

    In the Long-Term Evolution (LTE)-Advanced downlink, a user-specific demodulation reference signal (DM-RS) is used to support channel estimation and data demodulation for user-transparent multi-antenna and/or multi-point (MA/P) transmission techniques. A hybrid code division multiplexing (CDM) and frequency division multiplexing (FDM) scheme is adopted as a DM-RS multiplexing scheme for up to eight data streams per user. A time-domain orthogonal cover code (OCC) is used for CDM since time domain orthogonality among OCCs offers good robustness against channel variation. However, in a medium-to-high mobility environment, orthogonality distortion occurs among OCCs, which results in performance degradation. In this paper, we propose a two-dimensional (2D)-OCC mapping that achieves two-dimensional orthogonality in the time and frequency domains to improve the performance of CDM-based DM-RSs while reducing the peak transmission power of the OFDM symbol which includes the DM-RSs. Simulation results show that the proposed 2D-OCC mapping is effective in improving the block error rate performance especially in medium-to-high mobility environments. Furthermore, it is shown that the 2D-OCC mapping effectively reduces the peak power compared to the time-domain OCC mapping.

  • Performance of Interference Rejection Combining Receiver to Suppress Inter-Cell Interference in LTE-Advanced Downlink

    Yusuke OHWATARI  Nobuhiko MIKI  Takahiro ASAI  Tetsushi ABE  Hidekazu TAOKA  

     
    PAPER

      Page(s):
    3362-3369

    The interference rejection combining (IRC) receiver, which can suppress inter-cell interference, is effective in improving the cell-edge user throughput. The IRC receiver is typically based on the minimum mean square error (MMSE) criteria, which requires highly accurate channel estimation and covariance matrix estimation that includes the inter-cell interference. This paper investigates the gain from the IRC receiver in terms of the downlink user throughput performance in a multi-cell environment. In the evaluation, to assess the actual gain, the inter-cell interference signals including reference signals from the surrounding 56 cells are generated in the same way as the desired signals, and the channel propagation from all of the cells is explicitly taken into account considering pathloss, shadowing, and multipath fading. The results of simulations that assume the inter-site distance of 500 m, the spatial correlation at the transmitter and the receiver of 0.5, and the numbers of transmitter and receiver antennas of 2 and 2, respectively, show that the IRC receiver improves the cell-edge user throughput (defined as the 5% value in the cumulative distribution function) by approximately 15% compared to the simplified MMSE receiver that approximates the inter-cell interference as AWGN, at the cost of a drop in the average user throughput due to less accurate channel and covariance matrices. Furthermore, we consider dynamic switching between the IRC receiver and the simplified MMSE receiver according to the number of streams and modulation and coding scheme levels. The results show that with dynamic switching, both the cell-edge throughput and average user throughput are improved to the same level as that for the IRC receiver and the simplified MMSE receiver, respectively. Therefore, the best performance can be achieved by employing the dynamic switching in all throughput regions.

  • Dynamic Cooperative Silencing Control for Intercell Interference Control in Heterogeneous Cellular Networks

    Wonjong NOH  

     
    LETTER

      Page(s):
    3370-3373

    In heterogeneous cellular networks (HCN), which consists of macrocells and picocells, efficient interference management schemes between macrocells and picocells are crucial to the overall system performance. We propose a dynamic cooperative silencing (DCS) scheme for intercell interference control (ICIC). It is a low-complexity, low-feedback and distributed algorithm using only strongly interfered neighboring user information. A system simulation shows that the system performance and in particular the cell-edge throughput is significantly increased with the proposed silencing scheme.

  • Downlink Multi-Point Transmission Effect Using Aggregate Base Station Architecture

    Soon-Gi PARK  Dae-Young KIM  

     
    LETTER

      Page(s):
    3374-3377

    Downlink multi-point transmission as a capacity enhancement method for the users at cell edge and the operators is studied in this paper. It is based on the so-called aggregate base station architecture using distributed antennas and cloud computing. Its advantages are analyzed by both its architectural side and simulation. The simulation results show that the capacity may be affected by the number of cell belonging to an aggregate base station and by the parameters related to the operation of it.

  • Opportunistic Cooperative Multicast Based on Coded Cooperation

    Jiang YU  Youyun XU  Jinlong WANG  

     
    LETTER

      Page(s):
    3378-3381

    In this letter, we study cooperative transmission in wireless multicast networks. An opportunistic cooperative multicast scheme based on coded cooperation (OCM-CC) is proposed and its closed-form expression of outage performance is obtained. Through numeric evaluation, we analyze its outage probability with different numbers of relays and different cooperative ratios.

  • Achieving Diversity for Physical-Layer Network Coding Based Two-Way Multiple-Antenna Relay: A Two-Phase Diversity Scheme

    Hui GAO  Xin SU  Tiejun LV  Ruohan CAO  Taotao WANG  

     
    LETTER

      Page(s):
    3382-3386

    We propose a two-phase diversity scheme to achieve the end-to-end spatial diversity gain for physical-layer network coding (PNC) based two-way relay with a multiple-antenna relay node. A novel binary PNC-specific maximal-ratio-combining like (MRC-L) scheme is proposed to obtain receive diversity in the multiple-access (MA) phase with linear complexity; the Max-Min criterion based transmit antenna selection (TAS) is adopted to obtain transmit diversity in the broadcast (BC) phase. Both the brief diversity analysis and the Monte Carlo (MC) simulation results demonstrate that the proposed scheme achieves full diversity and outperforms other comparable schemes in terms of end-to-end diversity or power advantage.

  • Subcarrier Allocation for Physical-Layer Security in Cooperative OFDMA Networks

    Chunxiao CAI  Yueming CAI  Weiwei YANG  

     
    LETTER

      Page(s):
    3387-3390

    Secrecy on the physical layer is receiving increased research interest due to its theoretical and practical importance. In this letter, a subcarrier allocation scheme is proposed for physical-layer security in cooperative orthogonal frequency division multiple access (OFDMA) networks that use the Amplify-and-Forward (AF) strategy. We consider the subcarrier pairing and assignment to maximize overall system rates subject to a secrecy level requirement. Monte Carlo simulations are carried out to validate our analysis.

  • Distributed Precoding with Limited Interference Leakage for MU-MIMO System

    Weidong WANG  Gaofeng CUI  Sixing LU  Yinghai ZHANG  

     
    LETTER

      Page(s):
    3391-3394

    The capacity of Multiple-Input Multiple-Output networks (MIMO) is seriously degraded by interference. Many solutions have been given to overcome this problem, such as network MIMO and maximum signal to leakage plus noise ratio (max-SLNR). In this letter, a downlink distributed precoding method is proposed to nullify the intra-cell interference and mitigate the negative effect on other cell users. This method can keep the merits of network MIMO and max-SLNR while overcoming their shortcomings. Numerical results show that the proposed precoding method outperforms Block Diagonalization (BD), max-SLNR and Block Diagonalization with Other Cell Interference (BD-OCI).

  • Gain Matrix Design Method to Ensure Reciprocity in TDD MIMO Relay Systems

    Lei SONG  Lihua LI  Xiangchuan GAO  Hualei WANG  Yuan LUO  

     
    LETTER

      Page(s):
    3395-3398

    This letter reveals that whole link reciprocity does not exist in general amplify-and-forward (AF) time division duplex (TDD) relay systems due to the gain matrix. To resolve this problem, a novel gain matrix design method is proposed. Any existing gain matrix design criterion can be adopted in the downlink (uplink) to ensure optimal performance, and the proposed scheme is used in the uplink (downlink), with small adjustment, to keep whole link reciprocity. Simulation results show that, the proposed method can maintain whole link reciprocity without performance loss.

  • Regular Section
  • Optimal Buffer Partitioning on a Multiuser Wireless Link

    Omur OZEL  Elif UYSAL-BIYIKOGLU  Tolga GIRICI  

     
    PAPER-Fundamental Theories for Communications

      Page(s):
    3399-3411

    A finite buffer shared by multiple packet queues is considered. Partitioning the buffer to maximize total throughput is formulated as a resource allocation problem, the solution is shown to be achieved by a greedy incremental algorithm in polynomial time. The optimal buffer allocation strategy is applied to different models for a wireless downlink. First, a set of parallel M/M/1/mi queues, corresponding to a downlink with orthogonal channels is considered. It is verified that at high load, optimal buffer partitioning can boost the throughput significantly with respect to complete sharing of the buffer. Next, the problem of optimal combined buffer allocation and channel assignment problems are shown to be separable in an outage scenario. Motivated by this observation, buffer allocation is considered in a system where users need to be multiplexed and scheduled based on channel state. It is observed that under finite buffers in the high load regime, scheduling simply with respect to channel state with a simply partitioned buffer achieves comparable throughput to combined channel and queue-aware scheduling.

  • Dynamic Wavelength Allocation in Integrated Optical Path and Optical Packet Switch

    Dang-Quang BUI  Hiroaki HARAI  Won-Joo HWANG  

     
    PAPER-Fundamental Theories for Communications

      Page(s):
    3412-3420

    Integration of optical paths and packets in a switch is a key technique to support ultra-high-speed traffic in the future Internet. However, the question of how to efficiently allocate wavelengths for optical paths and optical packets has not been solved yet due to the lack of a systematic model to evaluate the performance of the integrated switch. In this paper, we model the operation of the integrated switch as a system of two queuing models: M/M/x/x for optical paths and M/M/1/LPS for optical packets. From the model, we find an optimal policy to dynamically allocate wavelength resources in an integrated switch. Simulation results demonstrate that our mechanism achieves better performance than other methods.

  • Digital PID Control Forward Type Multiple-Output DC-DC Converter

    Fujio KUROKAWA  Tomoyuki MIZOGUCHI  Kimitoshi UENO  Hiroyuki OSUGA  

     
    PAPER-Energy in Electronics Communications

      Page(s):
    3421-3428

    The purpose of this paper is to present the static and dynamic characteristics and a smart design approach for the digital PID control forward type multiple-output dc-dc converter. The central problem of a smart design approach is how to decide the integral coefficient. Since the integral coefficient decision depends on the static characteristics, whatever integral coefficient is selected will not be yield superior dynamic characteristics. Accordingly, it is important to identify the integral coefficient that optimizes static as well as dynamic characteristics. In proposed design approach, it set the upper and lower of input voltage and output current of regulation range. The optimal integral coefficient is decided by the regulation range of the static characteristics and the dynamic characteristics and then the smart design approach is summarized. As a result, the convergence time is improved 50% compared with the conventional designed circuit.

  • Proposal of Spectrum-Interleaved Duplex WDM-PON Using Spectrum-Sliced Broadband Incoherent Light with Reflection Remover

    Manabu YOSHINO  Junichi KANI  Noriki MIKI  Naoto YOSHIMOTO  Hisaya HADAMA  

     
    PAPER-Fiber-Optic Transmission for Communications

      Page(s):
    3429-3436

    A Wavelength division multiplexing passive optical network (WDM-PON) system that uses spectrum-sliced broadband incoherent light is attractive because it avoids the cost of operating/administering wavelengths in optical network units (ONU) at customer premises. However, it is difficult to enhance the spectrum efficiency to ensure a sufficient signal to noise ratio because it would demand broad channel width. To overcome this problem, we proposed a spectrum-interleaved duplex technique. It enables upstream and downstream communications to share one channel by using a cyclic filter. This sharing of one channel eliminates the need for a guard interval between signal lights duplexed in the channel. One residual issue regarding single band transmission is its robustness to reflection in the transmission medium. To increase the reflection robustness of the spectrum-interleaved duplex scheme, we propose a reflection remover based on an optical code division multiplexing technique. We also evaluate the extent to which capacity of the spectrum efficiency of the spectrum-interleaved duplex WDM-PON system that uses spectrum-sliced broadband incoherent light can be increased.

  • Performance Analysis of Clos-Network Packet Switch with Virtual Output Queues

    Eiji OKI  Nattapong KITSUWAN  Roberto ROJAS-CESSA  

     
    PAPER-Network System

      Page(s):
    3437-3446

    A three-stage Clos-network switch with input queues is attractive for practical implementation of a large-capacity packet switch. A scheme that configures the first, second, and third stages in that sequence by performing iterative matchings based on random selections is called the staged random scheduling scheme. Despite the usefulness of such a switch, the literature provides no analytical formula that can accurately calculate its throughput. This paper develops a formula to calculate the throughput analysis of the staged random scheduling scheme for one and multiple iterations used in an input-queued Clos-network switch under uniform traffic. This formula can be used to verify simulation models for very large switches. The introduced derivation considers the processes of the selection scheme at each stage of the switch. The derived formula is used in numerical evaluations to show the throughput of large switch sizes. The results show that the staged random scheduling scheme with multiple iterations for a Clos-network switch with VOQs without internal expansion approaches 100% throughput under uniform traffic. Furthermore, evaluations of the derived formulas are used in a practical application to estimate the number of iterations required to achieve 99% throughput for a given switch size. In addition, the staged random scheduling scheme in an input-queued Clos-network switch is modeled and simulated to compare throughput estimations to those obtained with the derived formulas. The simulation results support the correctness of the derived formulas.

  • Traffic State Estimation with Mobile Phones Based on the “3R” Philosophy

    Quang TRAN MINH  Eiji KAMIOKA  

     
    PAPER-Network

      Page(s):
    3447-3458

    This paper proposes a novel approach to traffic state estimation using mobile phones. In this work, a real-time traffic data collection policy based on the so-called “3R” philosophy, a unique vehicle classification method, and a reasonable traffic state quantification model are proposed. The “3R” philosophy, in which the Right data are collected by the Right mobile devices at the Right time, helps to improve not only the effectiveness but also the scalability of the traffic state estimation model. The vehicle classification method using the simple data collected by mobile phones makes the traffic state estimation more accurate. The traffic state quantification model integrates both the mean speed capacity and the density of a traffic flow to improve the comprehensibility of the traffic condition. The experimental results reveal the effectiveness as well as the robustness of the proposed solutions.

  • Telecommunications Network Planning Method Based on Probabilistic Risk Assessment

    Nagao OGINO  Hajime NAKAMURA  

     
    PAPER-Network

      Page(s):
    3459-3470

    Telecommunications networks have become an important social infrastructure, and their robustness is considered to be a matter of social significance. Conventional network planning methods are generally based on the maximum volume of ordinary traffic and only assume explicitly specified failure scenarios. Therefore, present networks have marginal survivability against multiple failures induced by an extraordinarily high volume of traffic generated during times of natural disasters or popular social events. This paper proposes a telecommunications network planning method based on probabilistic risk assessment. In this method, risk criterion reflecting the degree of risk due to extraordinarily large traffic loads is predefined and estimated using probabilistic risk assessment. The probabilistic risk assessment can efficiently calculate the small but non-negligible probability that a series of multiple failures will occur in the considered network. Detailed procedures for the proposed planning method are explained using a district mobile network in terms of the extraordinarily large traffic volume resulting from earthquakes. As an application example of the proposed method, capacity dimensioning for the local session servers within the district mobile network is executed to reduce the risk criterion most effectively. Moreover, the optimum traffic-rerouting scheme that minimizes the estimated risk criterion is ascertained simultaneously. From the application example, the proposed planning method is verified to realize a telecommunications network with sufficient robustness against the extraordinarily high volume of traffic caused by the earthquakes.

  • PARC: Power Aware Routing and Clustering Scheme for Wireless Sensor Networks

    Taiju MIKOSHI  Shinichi MOMMA  Toyofumi TAKENAKA  

     
    PAPER-Network

      Page(s):
    3471-3479

    In wireless sensor networks constructed from battery driven nodes, it is difficult to supply electric power to the nodes. Because of this, the power consumption must be reduced. To cope with this problem, clustering techniques have been proposed. EACLE is a method that uses a clustering technique. In EACLE, route selection is executed independently after the CH (Cluster Head) selection. This two-phase control approach increases overheads and reduces the battery power, which shortens the lifetime of wireless sensor networks. To cope with this problem, we have proposed a novel routing and clustering method called PARC for wireless sensor networks that reduces these overheads by integrating the cluster selection phase and the route construction phase into a single phase. However, PARC has a weak point in that the batteries of CHs around the sink node are depleted earlier than the other nodes and the sink node cannot collect sensing data. This phenomenon is called the hot spot problem. In order to cope with this problem of PARC, we propose PARC+, which extends the CH selection method of PARC such as more nodes around the sink can be selected as a CH node. We evaluate our proposed methods by simulation experiments and show its effectiveness.

  • Balanced Frequency Reuse with Ordering and Directional Subcarrier Allocation in OFDMA Systems

    Tae-Kyeong CHO  Chang-Yeong OH  Tae-Jin LEE  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3480-3489

    In multi-cell OFDMA-based networks, co-channel interference (CCI) is inevitable when the frequency reuse scheme is used. The CCI affects the performance of users, especially that of cell edge users. Several frequency reuse schemes and subcarrier allocation algorithms have been proposed to solve the CCI problem. Nevertheless, it is difficult to improve both the cell capacity and the performance of cell edge users since they have a trade-off. In this paper, we propose a new balanced frequency reuse (BFR) as a new frequency partitioning scheme that gives more power to the users in the outer region and allocates more subcarriers to the users in the inner region. In addition, we propose ordering and directional subcarrier allocation (ODSA) for our frequency partitioning proposal to mitigate the CCI effectively when cells have heterogeneous traffic loads. The performance of the proposed BFR with the ODSA algorithm is investigated via analyses and simulations. Performance evaluation shows that the proposed BFR with the ODSA algorithm can increase both the spectral efficiency and the performance of cell edge users if the transmission power is appropriately handled.

  • Network Selection for Cognitive Radio Based on Fuzzy Learning

    Mo LI  Youyun XU  Ruiqin MIAO  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3490-3497

    Cognitive radio is a promising approach to ensuring the coexistence of heterogeneous wireless networks since it can perceive wireless conditions and freely switch among different network modes. When there are many network opportunities, how to decide the appropriate network selection for CR user's current service is the main problem we study in this paper. We make full use of the intelligent characteristic of CR user and propose a fuzzy learning based network selection scheme, in which the network selection choice is made based on the estimated evaluations of available networks. Multiple factors are considered when estimating these evaluations. Both the outer environment factors directly sensed by CR user (signal strength of the available network and network mode), and also the factor that cannot be determined beforehand and is learnt by our scheme (the bandwidth allocated by the optional network) are considered. From several interactions with the wireless environment, the experience of network selection behavior is accumulated which will direct our scheme to make a proper decision of the network. Two simulations verify that our scheme could not only guarantee a better bandwidth requirement of CR user compared with other three network selection methods, but also shows it to be a reasonable scheme for utilizing the available resources of these networks.

  • A Dynamic Spectrum Assignment Method for Call Blocking Probability Reduction in WiFi/WiMAX Integrated Networks

    Kazuhiko KINOSHITA  Yuichi KANAMORI  Keita KAWANO  Koso MURAKAMI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3498-3504

    With advances in communication technologies, network services provided via the Internet have become widely diversified, and people can use these services not only via wired networks but also via wireless networks. There are several wireless systems in practical use such as cellular, WiMAX and WiFi. Although these wireless network systems have developed independently of each other, they should be integrated for seamless access by users. However, each system uses an individual spectrum prescribed by law to avoid radio interference. To overcome such a situation, dynamic spectrum access technology is receiving much attention. We propose a dynamic spectrum assignment method in which a WiFi system temporarily uses a spectrum band of the WiMAX system in WiFi/WiMAX integrated networks to reduce call blocking probability of multimedia communication services. We confirm the effectiveness of the proposed method by simulation experiments.

  • Sum Rate Optimization in Multiuser Cognitive Radio Networks

    Fanggang WANG  Bo AI  Zhangdui ZHONG  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3505-3514

    In multiuser cognitive radio (CR) networks, we address the problem of joint transmit beamforming (BF) and power control (PC) for secondary users (SUs) when they are allowed to transmit simultaneously with primary users (PUs). The objective is to optimize the network sum rate under the interference constraints of PUs, which is a nonconvex problem. Iterative dual subgradient (IDuSuG) algorithm is proposed by iteratively performing BF and PC to optimize the sum rate, among which minimum mean square error (MMSE) or virtual power-weighed projection (VIP2) is used to design beamformers and subgradient method is used to control the power. VIP2 algorithm is devised for the case in which the interference caused by MMSE beamformer exceeds the threshold. Moreover, channel uncertainty due to lack of cooperation is considered. A closed-form worst-case expression is derived, with which the uncertainty optimization problem is transformed into a certain one. A robust algorithm based on IDuSuG is provided by modifying updates in iterative process. Furthermore, second-order cone programming approximation (SOCPA) method is proposed as another robust algorithm. Typical network models are approximated to SOCP problems and solved by interior-point method. Finally the network sum rates for different PU and SU numbers are assessed for both certainty and uncertainty channel models by simulation.

  • Precoding Scheme Robust to Imperfect CSI in Downlink Multiuser MIMO-OFDM System

    Linchen CHANG  Kazuhiko FUKAWA  Hiroshi SUZUKI  Satoshi SUYAMA  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3515-3524

    This paper proposes a precoding scheme for downlink multiuser MIMO-OFDM systems. The proposed precoding employs the minimum average bit error rate (MABER) criterion, and obtains precoding matrices by the steepest descent algorithm in order to minimize average BER of mobile stations. As the cost function of the proposed scheme, an upper bound of the average BER is derived from the pairwise error probability (PEP) and is averaged with respect to channel state information (CSI) errors. Thus, the MABER scheme is robust against imperfect CSI. Computer simulations under a frequency-selective fading condition demonstrate that the proposed precoder is more robust against the CSI errors than both the zero-forcing (ZF) precoder and a robust sum mean square error (SMSE) precoder, and that it is superior in BER to the conventional schemes.

  • On the Effective Throughput Gain of Cooperative Diversity with a Fast Retransmission Scheme for Delay-Sensitive Flows

    Yao-Liang CHUNG  Zsehong TSAI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3525-3531

    This work addresses the problem of a fast packet retransmission scheme intended for transporting delay-sensitive flows in a Cooperative Diversity (CD) environment. This cooperative fast retransmission scheme exploits the advantages of the CD environment and hybrid Automatic-Repeat-reQuest (ARQ), while allowing retransmission just one time via a cooperating user (i.e., partner) or via both the sender and the partner simultaneously. Complementary link packets are used for the retransmission whose policy can be adjusted on the basis of the qualities of channels among the sender, the partner and the receiver, as well as the application layer protocol data unit size, using the application throughput as the objective. For this scheme, we first derive the application throughput formulas which are then verified via simulations. Next, the CD-based optimized fast retransmission scheme is shown able to achieve better effective throughput (goodput) than other CD-based or non-CD-based ARQ schemes in various Nakagami-m slow-fading environments. As a result, the proposed scheme should be an excellent fast retransmission mechanism for real-time multimedia transport in many CD environments.

  • An Improved Gradient-Based PAPR Reduction Method for Space Shift Keying (SSK)-OFDM Systems

    Ping YANG  Yue XIAO  Lilin DAN  Shaoqian LI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3532-3539

    Space shift keying (SSK), conveying data symbols via only the antenna indices, is a new modulation technique for low-complexity implementation of multiple-input multiple-output (MIMO) systems. SSK can be combined with the orthogonal frequency division multiplexing (OFDM) technique to improve the capacity and reliability of transmission. However, the SSK MIMO-OFDM systems also inherit from OFDM systems the drawback of a high peak-to-average power ratio (PAPR) of the transmitted signal. To overcome this problem, in this paper, the special information-conveying mode of SSK is utilized and a fast-converged gradient-based PAPR reduction method which exploits the phase freedom of the transmitted SSK MIMO-OFDM signal in the frequency domain is proposed. Simulation results show that the proposed improved gradient-based method (GBM) achieves a superior PAPR performance, as compared to the promising discrete phase set based schemes such as selected mapping method (SLM) and flipping method. Besides the considerable PAPR reduction, the improved GBM also enjoys other advantages such as low complexity, and neglectable performance loss.

  • Transmission Performance of Space Time Block Coding with Grouped Phase Rotation for Asymmetric MIMO-OFDM System

    Akinori NAKAJIMA  Kenichiro TANAKA  Akinori OHASHI  Hiroshi HATTORI  Akihiro OKAZAKI  Hiroshi KUBO  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3540-3549

    To improve the quality of wireless communication, transmit/receive diversity techniques in multiple-input multiple-output (MIMO) system have been investigated vigorously. In this paper, we consider an asymmetric MIMO orthogonal frequency division multiplexing (MIMO-OFDM) system, in which the number of transmit antennas is larger than that of receive antennas. In this system, there is a need to achieve the high quality of communication in both low and high mobility scenarios by a single transmit diversity scheme. Recently, as for the advanced diversity schemes based on space time block coding (STBC)/space frequency block coding (SFBC), STBC/STBC-phase shift diversity (PSD) and SFBC-frequency switched transmit diversity (FSTD) have been proposed. However, in these schemes, it is possible that time diversity gain can not be sufficiently obtained especially in the low mobility scenario. Therefore, in this paper, the joint use of grouped phase rotation in time/frequency domain and STBC (GPR-STBC) is proposed to get the larger channel coding gains than other schemes. In this paper, we evaluate the average bit error rate (BER) performance by computer simulation in a comparison with the conventional transmit diversity schemes and discuss the relationship from the viewpoints of BER performance and computational complexity.

  • An Effective Downlink Resource Allocation Scheme Based on MIMO-OFDMA-CDM in Cellular System

    Yasuhiro FUWA  Eiji OKAMOTO  Yasunori IWANAMI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3550-3558

    Orthogonal frequency division multiple access (OFDMA) is adopted as a multiuser access scheme in recent cellular systems such as long term evolution (LTE) and WiMAX. In those systems, the performance improvement on cell-edge users is crucial to provide high-speed services. We propose a new resource allocation scheme based on multiple input multiple output – orthogonal frequency division multiple access – code division multiplexing (MIMO-OFDMA-CDM) to achieve performance improvements in terms of cell-edge user throughput, bit error rate, and fairness among users. The proposed scheme adopts code division multiplexing for MIMO-OFDMA and a modified proportional fairness algorithm for CDM, which enables the fairness among users and a higher throughput. The performance improvements are clarified by theoretical analysis and simulations.

  • Iterative MMSE Detection with Interference Cancellation for Up-Link HARQ Using Frequency-Domain Filtered SC-FDMA MIMO Multiplexing

    Suguru OKUYAMA  Tetsuya YAMAMOTO  Kazuki TAKEDA  Fumiyuki ADACHI  

     
    PAPER-Wireless Communication Technologies

      Page(s):
    3559-3568

    In this paper, we propose an iterative minimum mean square error detection with interference cancellation (MMSED-IC) for frequency-domain filtered single carrier (SC)-frequency-division multiple-access (FDMA) uplink transmission. The use of a square-root Nyquist transmit filter reduces the peak-to-average power ratio (PAPR) while increases the frequency-diversity gain. However, if carrier-frequency separation among multiple-access users is kept the same as the one used for the case of roll-off factor α=0 (i.e., brick-wall filter), then the adjacent users' spectra will overlap and multi-user interference (MUI) occurs. The proposed MMSED-IC can sufficiently suppress the MUI from adjacent users while achieving the maximum frequency-diversity gain. We apply the proposed MMSED-IC to a packet access using filtered SC-FDMA, multi-input multi-output (MIMO) multiplexing, and hybrid automatic repeat request (HARQ). It is shown by computer simulation that filtered SC-FDMA with α=1 can achieve higher throughput than orthogonal frequency division multiple access (OFDMA).

  • Automatic Clustering Collaborative Compressed Spectrum Sensing in Wide-Band Heterogeneous Cognitive Radio Networks

    Zhenghao ZHANG  Husheng LI  Changxing PEI  Qi ZENG  

     
    PAPER-Terrestrial Wireless Communication/Broadcasting Technologies

      Page(s):
    3569-3578

    There are two major challenges in wide-band spectrum sensing in a heterogenous spectrum environment. One is the spectrum acquisition in the wide-band scenario due to limited sampling capability; the other is how to collaborate in a heterogenous spectrum environment. Compressed spectrum sensing is a promising technology for wide-band signal acquisition but it requires effective collaboration to combat noise. However, most collaboration methods assume that all the secondary users share the same occupancy of primary users, which is invalid in a heterogenous spectrum environment where secondary users at different locations may be affected by different primary users. In this paper, we propose an automatic clustering collaborative compressed spectrum sensing (ACCSS) algorithm. A hierarchy probabilistic model is proposed to represent the compressed reconstruction procedure, and Dirichlet process mixed model is introduced to cluster the compressed measurements. Cluster membership estimation and compressed spectrum reconstruction are jointly implemented in the fusion center. Based on the probabilistic model, the compressed measurements from the same cluster can be effectively fused and used to jointly reconstruct the corresponding primary user's spectrum signal. Consequently, the spectrum occupancy status of each primary user can be attained. Numerical simulation results demonstrate that the proposed ACCSS algorithm can effectively estimate the cluster membership of each secondary user and improve compressed spectrum sensing performance under low signal-to-noise ratio.

  • Degrees-of-Freedom Based on Interference Alignment with Imperfect Channel Knowledge

    Won-Yong SHIN  Muryong KIM  Hyoseok YI  Ajung KIM  Bang Chul JUNG  

     
    LETTER-Fundamental Theories for Communications

      Page(s):
    3579-3582

    The impact and benefits of channel state information (CSI) are analyzed in terms of degrees-of-freedom (DoFs) in a K-user interference network operating over time-selective channels, where the error variance of CSI estimation is assumed to scale with an exponent of the received signal-to-noise ratio (SNR). The original interference alignment (IA) scheme is used with a slight modification in the network. Then, it is shown that the DoFs promised by the original IA can be fully achieved under the condition that the CSI quality order, represented as a function of the error variance and the SNR, is greater than or equal to 1. Our result is extended to the case where the number of communication pairs, K, scales with the SNR, i.e., infinite K scenario, by introducing the user scaling order. As a result, this letter provides vital information to the system designer in terms of allocating training resources for channel estimation in practical cellular environments using IA.

  • Estimating ADSL Link Capacity by Measuring RTT of Different Length Packets

    Makoto AOKI  Eiji OKI  

     
    LETTER-Network

      Page(s):
    3583-3587

    This letter proposes a practical scheme that can estimate ADSL link rates. The proposed scheme allows us to estimate ADSL link rates from measurements made at the NOC using existing communications protocols and network node facilities; it imposes no heavy traffic overhead. The proposed scheme consists of two major steps. The first step is to collect measured data of round trip times (RTT) for both long and short packets to find their minimum values of RTTs by sending Internet Control Message Protocol (ICMP) echo request messages. The second step is to estimate the ADSL down- and up-link rates by using the difference in RTT between long and short packets and the experimentally-obtained correlated relationships between ADSL down- and up-link rates. RTTs are experimentally measured for an IP network, and it is shown that the down- and up-link rates can be obtained in a simple manner.

  • A Simplified 3D Localization Scheme Using Flying Anchors

    Quan Trung HOANG  Yoan SHIN  

     
    LETTER-Network

      Page(s):
    3588-3591

    WSNs (Wireless Sensor Networks) are becoming more widely used in various fields, and localization is a crucial and essential issue for sensor network applications. In this letter, we propose a low-complexity localization mechanism for WSNs that operate in 3D (three-dimensional) space. The basic idea is to use aerial vehicles that are deliberately equipped with anchor nodes. These anchors periodically broadcast beacon signals containing their current locations, and unknown nodes receive these signals as soon as the anchors enter their communication range. We estimate the locations of the unknown nodes based on the proposed scheme that transforms the 3D problem into 2D computations to reduce the complexity of 3D localization. Simulated results show that our approach is an effective scheme for 3D self-positioning in WSNs.

  • Accelerated Adaptive Deterministic Packet Marking

    Chengwei WAN  Julong LAN  Hongchao HU  

     
    LETTER-Internet

      Page(s):
    3592-3594

    The accurate and fast estimation of link price is the key component of network-based congestion control schemes. A fast estimation method A2DPM is presented. Multiple hashes on IP identifier of packet header are adopted to accelerate the side information transmission, so accurate estimation of maximum price on the flow forwarding path can be realized after the receipt of just a few probe packets, and the sender is capable of reacting to congestion more quickly, making it suitable to meet the demands of dynamic networks.

  • Fast Configuration for Mobile IPTV in IPv6 Networks

    Soohong PARK  Jun LEE  Choong Seon HONG  

     
    LETTER-Internet

      Page(s):
    3595-3598

    This letter proposes a new fast network configuration scheme that realizes an IP interface that allows users to view Internet Protocol TV (IPTV) in IPv6 networks more quickly than is possible with the current configuration procedure. The new scheme, a hybrid combination of IPv6, address information, and non-IP information, especially the Domain Name Service, is newly designed based on a technical analysis. The evaluation results show that the proposed scheme is acceptable for real-time television watching in IPv6 networks, even when in motion.

  • Weighted-Average Based AOA Parameter Estimations for LR-UWB Wireless Positioning System

    Yong Up LEE  

     
    LETTER-Antennas and Propagation

      Page(s):
    3599-3602

    A signal model and weighted-average based estimation techniques are proposed to estimate the angle-of-arrival (AOA) parameters of multiple clusters for a low data rate ultrawide band (LR-UWB) based wireless positioning system. The optimal AOA estimation techniques for the LR-UWB wireless positioning system according to the cluster condition are introduced and it is shown that the proposed techniques are superior to the conventional technique from the standpoint of performance.

  • Variations in SAR of Wireless Communication Devices Caused by Host Devices

    Takahiro IYAMA  Teruo ONISHI  

     
    LETTER-Electromagnetic Compatibility(EMC)

      Page(s):
    3603-3606

    The specific absorption rate (SAR) measurement procedure for wireless communication devices used in close proximity to the human body other than the ear was standardized by the International Electrotechnical Commission (IEC). This procedure is applicable to SAR measurement of data communication terminals that are used with host devices. Laptop PCs are assumed as host devices in this study. First, numerical modeling of laptop PCs and the validity of computations are verified with corresponding measurements. Next, mass averaged SARs are calculated dependent on the dimensions of the laptop PCs and the position of the terminals. The results show that the ratio of the maximum to minimum SARs is at most 2.0 for USB dongle and card-type terminals at 1950 MHz and 835 MHz.

  • A Novel Timing Estimation Method for Chirp-Based Systems

    Sanghun YOON  Dae-Gun OH  Jong-Wha CHONG  Tae Moon ROH  Jong-Kee KWON  Jongdae KIM  

     
    LETTER-Wireless Communication Technologies

      Page(s):
    3607-3609

    In this letter, we present a novel timing offset estimation method for chirp-based communication systems which is robust against frequency offset. For robust timing offset estimation, we propose a partial cross-correlation and differential multiplication method using up and down chirp symbols. The performances of the proposed estimator in indoor multipath channel model provided by IEEE 802.15.4a standard are presented in terms of mean-square error (MSE) obtained by computer simulation. The simulation results show that the proposed estimator has a significantly smaller MSE than the conventional estimators.

  • Low Complexity Hybrid Smart Antenna with Directional Elements over Frequency Selective Fading Channel

    Juinn-Horng DENG  Nuri CELIK  Zhengqing YUN  Magdy F. ISKANDER  

     
    LETTER-Wireless Communication Technologies

      Page(s):
    3610-3613

    In this paper, a low complexity hybrid smart antenna system with directional elements and reduced-size digital beamformer is proposed to combat the inter-symbol interference (ISI) problem over frequency-selective fading channel. For the conventional smart antenna system with omni-directional elements, it utilizes the full-size digital beamformer to suppress interference and obtain the optimum performance. However, the proposed hybrid smart antenna system with directional elements can be split the linear array receiver for two branches. One branch is the subarray system with non ISI interference, which can be used for maximum ratio combiner (MRC). Another branch is the reduced-size subarray system with the ISI interference, which can use the reduced-size optimum beamformer to suppress interference. Finally, the output signals of the two branches can be combined to detect the transmitted signals. Simulation results confirm that the proposed low complexity system can provide robust performance under the multipath fading channel.

  • Joint Blind Estimation of Channel Length and Noise Variance in OFDM Systems

    Bin SHENG  Pengcheng ZHU  Xiaohu YOU  

     
    LETTER-Wireless Communication Technologies

      Page(s):
    3614-3617

    The information of channel impulse response (CIR) length and noise variance play an important role in blind identification and equalization of wireless multipath channels. In orthogonal frequency division multiplexing (OFDM) systems, multipath fading channels introduce interference between adjacent symbols which can be prevented by inserting a cyclic prefix (CP) before each symbol. In this letter, we find that the interference power in the cyclic prefix (CP) interval and its variation can be used to estimate the CIR length and noise variance jointly and blindly.

  • A Low PAPR Multiple Access Scheme for LTE-A

    Yan MENG  Gang LIU  Limin MENG  Jingyu HUA  

     
    LETTER-Wireless Communication Technologies

      Page(s):
    3618-3622

    In this letter, we propose two antenna grouping schemes for uplink Nx SC-FDMA MIMO systems, where the multiple component carriers can be divided into several groups which are handled by different antennas, thus the number of component carriers on each antenna will be reduced by the group method. As a result, the peak-to-average power ratio (PAPR) of each antenna has been reduced. To further enhance the performance, an interleaving method is proposed to achieve better diversity gain due to the channel varying in the spatial domain and the frequency domain during one turbo coded stream. Our simulation figures clearly demonstrate that in all examples, the proposed schemes are shown to be effective in improving the Block Error Rate (BLER) performance while reducing the PAPR.

  • Spectrum Sensing by Exploiting the Similarity of PDFs of Two Time-Adjacent Detected Data Sets with Cross Entropy

    Junrong GU  Wenlong LIU  Sung Jeen JANG  Jae Moung KIM  

     
    LETTER-Terrestrial Wireless Communication/Broadcasting Technologies

      Page(s):
    3623-3626

    In spectrum sensing, if the primary user (PU) signal and the channel noise both follow Gaussian distribution and neither of their probability distribution functions (PDFs) are known, the traditional approaches based on entropy or Likelihood Ratio Test (LRT) etc., become infeasible. To address this problem, we propose a spectrum sensing method that exploits the similarity of PDFs of two time-adjacent detected data sets with cross entropy, while accounting for achieving the detection performance of LRT which is Neyman-Pearson optimal in detecting the primary user. We show that the detection performance of the proposed method asymptotically approximates that of LRT in detecting the PU. The simulation results confirm our analysis.

  • A Scheme for GNSS ISL Ranging and Time Synchronization under a New Time Division Duplex Mode

    Yong XU  Qing CHANG  Zhijian YU  

     
    LETTER-Navigation, Guidance and Control Systems

      Page(s):
    3627-3630

    Inter-satellite link (ISL) is an important part of the next generation global navigation satellite system (GNSS). In this paper, key technologies of GNSS ISL ranging and time synchronization are researched. Considering that Ka frequency band is used for ISL, a fixed topology is designed and a new time division duplex (TDD) mode is proposed after analyzing the characteristics of GNSS constellations. A novel method called Non-coherent Dual One-way Measuring (NC-DOWM) is applied to this TDD mode. In addition, relevant mathematical formulas, error models and error compensation are discussed in detail. It is found that the proposed NC-DOWM method for GNSS ISL ranging and time synchronization outperforms the current method for GPS in terms of channel utilization efficiency and measuring precision. Furthermore, the presented method has excellent anti-interference capability and engineering feasibility, which can provide a strong technical support for the ISL of the next generation GNSS.

  • A Visual Perception Based View Navigation Trick Mode in the Panoramic Video Streaming Service

    Joo Myoung SEOK  Junggon KO  Younghun LEE  Doug Young SUH  

     
    LETTER-Multimedia Systems for Communications

      Page(s):
    3631-3634

    For the panoramic video streaming service, this letter proposes a visual perception-based view navigation trick mode (VP-VNTM) that reduces bandwidth requirements by adjusting the quality of transmitting views in accordance with the view navigation velocity without decreasing the user's visual sensitivity. Experiments show that the proposed VP-VNTM reduces bandwidth requirements by more than 44%.