Blind Known Interference Cancellation

Slides:



Advertisements
Similar presentations
A DISTRIBUTED CSMA ALGORITHM FOR THROUGHPUT AND UTILITY MAXIMIZATION IN WIRELESS NETWORKS.
Advertisements

Effective Cooperative Channel Sensing for CR Ad Hoc Networks Wireless Network Lab. Copyright Wireless Networks Lab. CSE. SNU. All rights reserved.
Interference Cancellation in Two-Path Successive Relay System with Network Coding Chunbo Luo, Dr. Yu Gong & Prof. Fuchun Zheng School of Systems Engineering.
OFDM Transmission over Wideband Channel
Introduction[1] •Three techniques are used independently or in tandem to improve receiver signal quality •Equalization compensates for.
VSMC MIMO: A Spectral Efficient Scheme for Cooperative Relay in Cognitive Radio Networks 1.
Analog Network Coding Sachin Katti Shyamnath Gollakota and Dina Katabi.
Network Coding Testbed Using Software-Defined Radio Abstract In current generation networks, network nodes operate by replicating and forwarding the packets.
Channel Estimation for Mobile OFDM
SUCCESSIVE INTERFERENCE CANCELLATION IN VEHICULAR NETWORKS TO RELIEVE THE NEGATIVE IMPACT OF THE HIDDEN NODE PROBLEM Carlos Miguel Silva Couto Pereira.
5/21/20151 Mobile Ad hoc Networks COE 549 Capacity Regions Tarek Sheltami KFUPM CCSE COE
1 SMART ANTENNA TECHNIQUES AND THEIR APPLICATION TO WIRELESS AD HOC NETWORKS JACK H. WINTERS /11/13 碩一 謝旻欣.
MIMO and TCP: A CASE for CROSS LAYER DESIGN Soon Y. Oh, Mario Gerla Computer Science Dept. University of California, Los Angeles {soonoh,
FBRT: A Feedback-Based Reliable Transport Protocol for Wireless Sensor Networks Yangfan Zhou November, 2004 Supervisors: Dr. Michael Lyu and Dr. Jiangchuan.
Wireless Transmission Fundamentals (Physical Layer) Professor Honggang Wang
Cooperative Diversity Scheme Based on MIMO-OFDM in Small Cell Network Dong-Hyun Ha Sejong University.
Seyed Mohamad Alavi, Chi Zhou, Yu Cheng Department of Electrical and Computer Engineering Illinois Institute of Technology, Chicago, IL, USA ICC 2009.
International Technology Alliance In Network & Information Sciences International Technology Alliance In Network & Information Sciences 1 Cooperative Wireless.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
An algorithm for dynamic spectrum allocation in shadowing environment and with communication constraints Konstantinos Koufos Helsinki University of Technology.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,
1 Optimal Power Allocation and AP Deployment in Green Wireless Cooperative Communications Xiaoxia Zhang Department of Electrical.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
HUSEYIN ARSLAN Electrical Engineering EE-6593 Course Outline Lecture-2: Basics of wireless –Important terminology and definitions (wireless, mobile, cellular,
1 Yue Qiao Computer Science and Engineering Sep AirExpress: Enabling Seamless In-band.
Multiuser Detection (MUD) Combined with array signal processing in current wireless communication environments Wed. 박사 3학기 구 정 회.
Network Coding Testbed Jeremy Bergan, Ben Green, Alex Lee.
Ali Al-Saihati ID# Ghassan Linjawi
Performance analysis of channel estimation and adaptive equalization in slow fading channel Chen Zhifeng Electrical and Computer Engineering University.
Power Control in Wireless Ad Hoc Networks Background An ad hoc network is a group of self configuring wireless nodes that lack infrastructure. Motivation—Power.
Ghost Femtocells: a Novel Radio Resource Management Scheme for OFDMA Based Networks WCNC 2011.
1 Blind Channel Identification and Equalization in Dense Wireless Sensor Networks with Distributed Transmissions Xiaohua (Edward) Li Department of Electrical.
OFDM Based WLAN System Song Ziqi Zhang Zhuo.
Networks and Mobile Systems Research Group MIT Laboratory for Computer Science nms.lcs.mit.edu RadioActive Networks: Robust Wireless Communications John.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Cooperative Caching in Wireless P2P Networks: Design, Implementation And Evaluation.
Embracing Wireless Interference : Analog Network Coding By Sachin Katti, Shyamnath Gollakota, and Dina Katabi Shyamala Villupuram Sundararaman.
Bridging the Gap: A Deterministic Model for Wireless Links David Tse Wireless Foundations U.C. Berkeley NSF Wireless Networks Workshop Aug 27, 2007 TexPoint.
A G3-PLC Network Simulator with Enhanced Link Level Modeling
Digital transmission over a fading channel
Adnan Quadri & Dr. Naima Kaabouch Optimization Efficiency
Advanced Wireless Networks
One Problem of Reliability In Collaborative Communication System
PERFORMANCE ANALYSIS OF SPECTRUM SENSING USING COGNITIVE RADIO
UNIT I – Wireless channels
A Rate-Adaptive MAC Protocol for Multi-Hop Wireless Networks
Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory
Full Duplex Benefits and Challenges
CS 457 – Lecture 7 Wireless Networks
15-744: Computer Networking
Distributed MIMO Patrick Maechler April 2, 2008.
Colorado School of Mines
Near-Optimal Hybrid Analog and Digital Precoding for Downlink mmWave Massive MIMO Systems Linglong Dai1, Xinyu Gao1, Jinguo Quan2, and Shuangfeng Han3,
Network Coding Testbed
Su Yi Babak Azimi-Sadjad Shivkumar Kalyanaraman
Wireless Channels Y. Richard Yang 01/12/2011.
Network Coding Testbed
Intelligent Antenna Sharing in Wireless Networks
EVM vs PER Plot Not Promising for PSNI
Chen Zhifeng Electrical and Computer Engineering University of Florida
Data Link Layer 2019/2/19.
Month Year doc.: IEEE yy/xxxxr0 January 2008
doc.: n Jeff Gilbert Atheros Communications
doc.: n Jeff Gilbert Atheros Communications
AccuRate: Constellation Aware Rate Estimation in Wireless Networks
CSMA/CN: Carrier Sense Multiple Access with Collision Notification
Two-Way Coding by Beam-Forming for WLAN
Full Duplex Benefits and Challenges
Towards characterizing the capacity of the building block of MANETs
Presentation transcript:

Blind Known Interference Cancellation Zhang Shengli (Shenzhen University) 2012. 1.12 Good morning every one, I am happy to have this opportunisty to share my latest research result. Blind known interference cancellation. This paper has been accpeted by JSAC with minor revision and it can be accessed on Arxiv.

Background Analog network coding Software defined radio help us find new research problems Most of us believed that Analog network coding is simple to implement. When we try to implement ANC, However, we found that it is not a easy task. The Qustion is how to cancel the known interference at the end node. We then decided to work on it.

Known Interference Successive interference cancellation Relay networks Over hearing Then we made a simple survey and found that known interference does exist in many wireless systems. The most famous example is the successive interference cancellation. In SIC, we fist detect one layer signal. Now, this layer signal becomes the known interference and need to be cancelled from the received signals. In one way relay channel, the signal transmitted by the relay is known, is interference to the source. In some Ad hoc networks, some node can overhear other link’s transmission and the overheared packet may help to change later interference to known interference. Our survey found that there is no satisfactory solutions for this problem.

Traditional Cancellation Two Steps: Interfering channel estimation Subtracting Interference Obstacle: channel estimation Cooperation design in ANC paper Cooperation cost Direct estimation with interference Bad performance Non-coherent detection 3dB performance loss

BKIC(1) We then proposed a new algorithm, Blind known interference cancellation. Consider a general receiver, the BKIC module may be inserted as in the figure.

BKIC(2) Step 1: Step 2 (critical step): For BKIC module, the processing includes two steps. In the first step, we cancel the interference based on the fact that the channel between adjacent symbols is almost the same. We use a weighted sum to cancel the interference. The first step looks simple. The most critical step in BKIC is the second step to recover the target signal from the interference-free signal.

Recovering Scheme1 Straightforward way Equivalent to traditional cancellation

Recovering Scheme2 Real-valued BP

Multipath Case Scheme 1: cancel all the paths of the interference with complex RBP in one cycle To be done Scheme2: cancel each path one by one

Performance Flat fading

Performance Flat fading

Performance Time selective fading

Performance Frequency selective fading

Performance Frequency selective fading

Conclusion and Future Work BKIC is a novel algorithm for a mature problem It’s of great practical interest and it also needs more theoretical study In the future, we may focus on its application in different areas and its implementation with SDR.