A Frequency Hopping Algorithm for Cordless Telephone Systems
|
|
- Stephanie Ross
- 8 years ago
- Views:
Transcription
1 A Frequency Hopping Algorithm for Cordless Telephone Systems André Noll Barreto, Jürgen Deißner and Gerhard Fettweis Dresden University of Technology Chair for Mobile Communication Systems, Dresden, Germany In this paper a novel frequency hopping algorithm is introduced, which is tailored for use in a Cordless Telephone System (CTS) that relies on total frequency hopping to use the same frequency band as a GSM system.the algorithm was designed with the goal of minimising the interference between different CTS-units and between the CTS and the overlay GSM network, taking into account standard GSM interleaving and coding procedures. It is part of the GSM- CTS implementation assumption for standardisation at ETSI. The proposed algorithm is described and simulation results are shown to prove its optimal characteristics. - Introduction The introduction of cellular mobile communication systems has enabled a great degree of mobility in telecommunication services, and among the different standards, GSM and GSM8 are being employed in many countries all over the world. Nevertheless, a typical user spends a reasonable amount of time at fixed locations, such as at home or in the office, and it is then usual to use the conventional fixed line network, which provides lower charges and better quality. Furthermore, indoor environments often lack the adequate radio coverage for a successful connection to a PLMN. It would be desirable to have a single terminal which is able to connect to both a PLMN and the fixed network. A dual-mode terminal, such as a GSM/DECT mobile terminal, provides this feature, but a simpler solution is to develop a GSM mobile terminal that can also be used as a cordless phone based on the GSM air interface. This would require just a slight modification in a GSM hand-held set, as well as a CTS-Fixed Part, which is connected to the fixed network[]. In order to comply with regulations and to avoid hardware modifications, the same frequency band as in a GSM PLMN must be used. However, the location of the CTSs are defined by the users and cannot be controlled by the PLMN operator, which prevents their inclusion in the operator s frequency planning. This implies that a way to minimise the interference between the CTS units and the GSM overlay network has to be found. One way to implement the CTSs without causing a significant interference in the GSM network is to employ slow frequency hopping [,], preferably over a large number of frequencies, so that in each burst a different radio channel is affected, and eventual collisions can be resolved by interleaving and decoding. It is also envisaged to assign to each. This work was supported by Alcatel user a different FH sequence, which can be used for authentication. Due to this fact, and to eliminate the possibility that a PLMN user and a CTS employ the same FH sequence, a new FH algorithm is required, even though frequency hopping is already standardised for GSM []. Additionally, the frequency hopping code developed for this application can also be employed for the fast deployment of picocells, which are to be used for serving hotspots within an overlaying macrocell, without requiring frequency planning. - Requirements for the FH Algorithms Complying to the demands of a CTS, some characteristics are desired for the frequency hopping code. These are discussed in this section. The code size L is the number of different codewords that can be generated by a particular algorithm. Since in the CTS proposal the FH sequence is also a part of the authentication process, a large number of different sequences must be available in order to prevent unauthorised mobiles from having access granted. Moreover, having in mind that the code and location of different CTSs cannot be planned, a large code size prevents two neighbour CTSs from sharing the same FH sequence. For those reasons, the code size should be as large as possible. Long sequences are required due to their use for authentication, since short sequences can be easily scanned and reconstructed by a defrauder. As a reference, we consider that a period at least as long as the one obtained with the standard GSM frequency hopping code (T = 88) is desired. The alphabet size N, i.e., the number of different frequencies, should be flexible, since the number of available frequencies may depend on regulatory issues and on agreements with different network operators. In a possible implementation the number of available frequencies for frequency hopping changes depending on the interference levels on each channel, what would also require a flexible alphabet size. Usually, the most important figure of merit of FH codes is the distribution of the Hamming correlation [], but for our application an analysis has to be made which takes into account the interference between codes with possibly different periods (e.g., between a CTS and the PLMN), in which case this concept no longer applies. A more adequate and similar figure of merit is the hit probability, i.e, the probability that two FH sequences share the same frequency in a given burst. If the transmitter hops over N
2 frequencies, it can be expected that the mean value of the hit probability will be equal to /N, considering every possible pair of sequences at every possible relative delay. However, this may not be the case for every pair of sequences, and some pairs may have a much larger hit probability. Our goal is to design FH codes with a low variance in the hit probability distribution, and hence with few pairs of sequences showing a large hit probability. An optimal algorithm satisfies the following condition for every pair of sequences. T N P hit T Furthermore, if we consider the application of frequency hopping in GSM, we must also take interleaving and coding into account. If many hits occur within the interleaving depth, the decoder will probably not be able to correct the errors, and therefore a code in which the hits are more evenly distributed in time is preferred. We assume that up to hits within an interleaving depth of 8 can be corrected [7]. It should be reminded that, in accordance to the proposed application, the appropriate code should have good hit probability characteristics in the following three different interference scenarios.. The hits between two sequences generated by different CTSs.. The hits between a sequence generated by a CTS and a PLMN user not using frequency hopping.. The hits between a sequence generated by a CTS and a PLMN user using frequency hopping. The second and the third scenarios can be considered more important, since one major requirement is that the PLMN services should be barely disturbed by the introduction of the CTSs. Besides satisfying all the above requirements, the frequency hopping algorithm should be easy to implement. - The Frequency Hopping Algorithm Many different frequency hopping codes have been suggested in the literature [-], but none of them satisfies all the above requirements. The codes presented in [,8-,] have all a short period, at the same order of magnitude as the alphabet size, whereas the codes introduced in [,] have rather small code sizes. The codes suggested by Kumar [7] and Vajda [] can have a long period and a large code size, but have an inflexible alphabet size and are relatively difficult to implement. Moreover, as we can see in the next section, the Kumar code does not perform very well when the interference between the CTSs and the PLMN is investigated. We have taken as a basis for our algorithm the Lempel- Greenberger code[]. It is a code with optimal Hamming correlation properties and long period, but it has three () major drawbacks. It has an inflexible alphabet size, which must be the power of a prime number; a limited code size, equal to the alphabet size; and long runs of the same frequency tend to occur, which is unfavourable for the second interference scenario, besides not providing sufficient frequency diversity. In this section we first describe this code and then introduce novel improvements.. Lempel-Greenberger Frequency Hopping Algorithm Let {s n } denote an m-sequence (i.e., a maximum length linear feedback shift register sequence), of period T LG = p J - over GF(p), where J is the number of shiftregister elements, and let b(n) be a K-tuple of consecutive elements {s n, s n -,..., s n-k- }. Now let v be any K- tuple over GF(p) and f(x) be a one-to-one mapping of a K- tuple over GF(p) into a set of p K different frequencies. Assuming that each sequence is defined by a different vector v, there are L LG = p K different frequency sequences defined by LG(n) =b(n) v f({b (n) v, b (n) v...,b K- (n) v K- }) (), where represents addition modulo p. This code can be proven to be optimal in terms of its Hamming correlation properties [], or equivalently, in terms of the hit probability distribution, as defined by equation ().. Modified Lempel-Greenberger Algorithm In order to increase the number of possible sequences, we first introduce a small modification, by allowing the K- tuples b (n) to be formed of any K different shift-register elements at any order. Now, apart from v, we assign to each different sequence a K-tuple a, describing which elements of the shift-register form the K-tuple b (n), so that b' ( n) = s n a, s n a,, s n ak () where a i <J and a i a j for i j. As in equation (), the sequence is formed by LG (n) =b (n) v. By this modification, L LG K! J K = p different K sequences can be generated, not counting delayed versions of the same sequence. The optimality in terms of the Hamming correlation can no longer be guaranteed, but its characteristics are nevertheless very good. The generation of the modified Lempel-Greenberger algorithm can be better visualised in Fig., with p =, J = 7, K = and a = {,,7}.
3 the above values is T our code = 897. v v f ( ) v LG (n) Generation of modified LG codeword n LG (n) l 7 b n b n - b n - 7 b n - b n - b n - b n - Mapping into an internal codeword c l c c =c c 7 =c c c Fig. - Implementation of a modified Lempel-Greenberger algorithm. Our algorithm (LG/NR) In order to eliminate the problem of runs of same frequencies, the concatenation of a Lempel-Greenberger with a Reed-Solomon code was proposed in [], but the difficulties with a small code size and inflexible alphabet size still remain. In our proposal, the modified Lempel-Greenberger code is block concatenated with an internal code, in whose codewords each frequency appears exactly once, and there are no restrictions on the alphabet size. Each internal codeword is constructed upon a base sequence of N nonrepeating integer elements c ={c, c,...,c N - }, c i <N and c i c j for i j. Different internal code sequences can be generated by the modulo N addition over the base sequence, i.e., an internal code sequence c l is given by : c l = {c l, c l,..., c N - l} (), where represents addition modulo N. There are therefore N different internal code sequences for each base sequence. We choose a modified Lempel-Greenberger code based on a binary shift-register, with K satisfying : K = log N In case the number of different internal sequences is smaller than the number of external code elements (i.e., K >N), some internal sequences are generated by two different outer code elements, and hence would occur twice as often as the other sequences. In order to prevent that, we add the count of register shifts to the external code element before mapping into an internal sequence. An example of the generation of the concatenated sequence x(k) can be seen in Fig., with c={,,,,,}, N =. Different sequences are characterised by different sets of a, v and c, and hence the number of different sequences is L our code = L LG (N-)!. For example, with J = 7 shift-register elements, N = 7 frequencies, and, according to (), K = there are L our code, different sequences, which is much more than for the codes found in the literature. The period of these sequences is T our code = NT LG, which for () x(k) Fig. - Example of code concatenation In the following sections this code will be referred as LG/NR, which stands for the concatenation of a Lempel- Greenberger with a non-repeating code. - Simulation Results As shown in the previous section, our algorithm has the appropriate characteristics in terms of period, code size and alphabet size. Since an analytical solution for the hit probability characteristics was not feasible, simulations were performed, and the results are shown in this section. As a reference we have compared our code with different existing codes, namely: the Lempel-Greenberger code with extended code size, i.e, including the modification introduced in the previous section; the Kumar code; and a modified version of the standard GSM code. In Fig. and Fig. the hit probability distribution of the different codes is displayed. For each code, different sequence pairs were correlated and for each pair the hit probability was obtained. The alphabet size is for every code, except for the Kumar code, for which it is equal to due to code constraints. The graphs show the corresponding histogram. It should be noticed that we want to minimise the occurrence of pairs of sequences with a high hit probability, and hence an ideal code would have a very concentrated hit probability distribution.in Fig. we can see the results corresponding to the interference between two CTSs, i.e., the hit probability distribution between two sequences generated by the same algorithm. It can be seen that the modified GSM algorithm has the worst performance, and the same behaviour can be observed in the standard GSM algorithm, which is probably due to some constraints imposed by synchronisation on the code design.. This modification has to be introduced in order to achieve a larger code size, which is limited to in the standard GSM code[]. It consists in generating different sequences with different RNTABLES. The RNTABLE is a look-up table defined in the GSM standards, and it represents a one-to-one mapping of integers between and into 7 bits. In the GSM standards this table is constant and the same for every user.
4 On the other hand, the modified Lempel-Greenberger has nearly optimal correlation properties, which means that the modifications did not alter to a great extent its properties. Both the Kumar and the LG/NR code have very good characteristics, similar to the ones expected from random sequences.. x Distribution We see in Fig. the simulation results for the interference between a CTS sequence and a user without frequency hopping. As we can see, the Lempel-Greenberger algoa) mod. GSM x mod. GSM 7 x Distribution c) Kumar x Kumar d) LG/NR x LG/NR Fig. - Histogram - Interference between two CTSs Fig. shows the results related to the interference between a CTS and a PLMN user without frequency hopping, i.e., it simply represents the probability of occurrence of any particular frequency. All codes, except the Kumar, have a good performance, but our code outperforms all the other. The results for the Kumar code indicate that some frequencies occur more often than the others. An analysis considering a PLMN with frequency hopping shows similar results, since in GSM networks frequency hopping is usually made over a small set of frequencies. As already mentioned in section, the effect of interleaving and coding should also be investigated, and we have considered an appropriate measure to be the number of hits occurring within 8 consecutive bursts, which is the interleaving depth of a GSM traffic channel. Assuming that the decoder is able to recover the signal if at least of these 8 bursts are received correctly [7], and that a hit can impair the correct reception of a burst, we shall consider the figure of merit to be the probability that more than hits occur within any window of 8 consecutive bursts. The results can be seen in Fig. and Fig., where besides the above cited codes, the results for a random code have also been displayed Distribution b) mod. LG x mod. LG 9 x Distribution x Distribution a) mod. GSM x no FH c) Kumar x no FH d)lg/nr x no FH Fig. - Histogram - Interference between a CTS and a PLMN user with no Frequency Hopping In Fig. the results obtained for two CTS sequences are shown. The standard GSM code was also simulated, and it has a much worse performance than the others, since due to the small code size, some sequences can be repeated. This justifies the need for a large code size and the introduction of a modified GSM code. All the other codes have performances similar to that obtained by a random code. Probability 8 x Distribution.... e Fig. - Probability of at least n hits in 8 consecutive bursts - Interference between two CTSs Distribution a) LG x no FH Distribution....8 Cumulative Probability of n hits in 8 consecutive bursts Random mod. GSM LG LGNR Kumar GSM e 8 7 Number of hits in 8 consecutive bursts
5 rithm performs rather badly by this criterion, since runs of the same frequency tend to happen. The Kumar code has a performance slightly worse than that obtained by a random code, what was expected from the results shown in Fig.. The modified GSM algorithm has good properties at this aspect, similar to the ones of a random code,but the LG/NR has by far the best results, since it was designed in a way that each frequency occurs no more than twice within the interleaving depth D(if D L + ). Probability.... e e 8 7 Number of hits in 8 consecutive bursts Fig. - Probability of at least n hits in 8 consecutive bursts - Interference between a CTS and a PLMN user without frequency hopping Simulation studies considering the performance of the different algorithms in a mobile communications system have also been undertaken. Initial results show that a lower Frame Erasure Rate can be obtained using the LG/NR algorithm instead of the GSM algorithm, and further information can be obtained from another study, yet to be published [8]. - Conclusion We have developed a new frequency hopping code suited for application in a Cordless Telephone System. This code satisfies all the requirements for the use in a CTS, such as long period, large code size and flexible alphabet size. Moreover, simulation results show that it has an outstanding performance in terms of hit probability properties, specially when considering the interference from a CTS with a PLMN user. These characteristics make it not just a good choice for employment in CTSs, but also for deploying PLMN picocells under existing macrocells, without requiring frequency planning. - References Cumulative Probability of n hits in 8 consecutive bursts Random mod. GSM LG LGNR Kumar [] Tdoc SMG 9/97 : Digital cellular telecommunications system (Phase +); GSM Cordless Telephony System (CTS), Phase ; Service Description (GSM.XX), ETSI 997 [] Tdoc SMG WPB /97 : Low interference GSM- Cordless telephony system description, ETSI 997 [] M.I. Silventoinen, M. Kuusela and P.A. Ranta, Analysis of a New Channel access Method for Home Base Statiom, ICUPC 9 [] ETS 77 : European Digital Cellular telecommunications System (Phase ); Radio Transmission and Reception (GSM.), ETSI 99 [] A. Lempel and H. Greenberger, Families of sequences with optimal Hamming correlation properties, IEEE Trans. Inf. Theory, Jan. 97, pp. 9-9 [] F.M. Assis, Hit probability between frequency hopping sequences generated by Reed-Solomon and Hermitian codes, Electronics Letters, Jul. 99, pp. 9-9 [7] P.V. Kumar, Frequency-hopping code sequence designs having large linear span, IEEE Trans. Inform. Theory, Jan 988, pp - [8] H.D. Lüke, Large families of polynomial phase sequences with low correlation, European Trans. on Telecomm., May-June 99, pp -8 [9] S.V. Marik, E.L. Titlebaum, A class of frequency hop codes with nearly ideal characteristics for use in multiple access spread-spectrum communications and radar and sonar systems, IEEE Trans. on Comm., Sep. 99, pp. -7 []R.M. Mersereau, T.S. Seay, Multiple access frequency hopping patterns with low ambiguity, IEEE Trans. on Aerospace and Electronic Systems, July 98, pp []A.A. Shaar, P.A.Davies, Prime sequences : quasioptimal sequences for OR channel code division multiplexing, Electronic Letters, 98, pp []A.A. Shaar, P.A.Davies, A survey of one-coincidence sequence sets for frequency-hopped spread spectrum systems, IEE Proc. - Part F : Commun., Radar and Signal Processing, Dec 98, pp []E.L. Titlebaum, Time frequency hop signals, Part I : Coding based upon the theory of linear congruencies, IEEE Trans. Aerospace and Electronic Systems, July 98, pp. 9- []I. Vajda, Code sequences for frequency-hopping multiple-access systems, IEEE Trans. on Commun., Oct. 99, pp. - []L.D. Wronski, R. Hossain and A.Albicki, Extended hyperbolic congruential frequency hop code : Generation and bounds for cross- and auto- ambiguity function, IEEE Trans. on Commun., March 99, pp. - []N. Burger, The design of frequency hopping patterns for multiple-access communications, M.S. Thesis, University of Illinois at Urbana-Champaign, Jan. 99 [7]M.Mouly and M.B. Pautet, The GSM system for mobile communications, 99 [8]J.Deissner, A.N. Barreto, U. Barth and G. Fettweis, Interference analysis of a total frequency-hopping GSM Cordless Telephony System, To be presented at PIMRC 98
Interference Analysis of a Total Frequency Hopping GSM Cordless Telephony System 1
Interference Analysis of a Total Frequency Hopping GSM Cordless Telephony System 1 Jürgen Deißner, André Noll Barreto, Ulrich Barth*, and Gerhard Fettweis Endowed Chair for Mobile Communications Systems
More informationRevision of Lecture Eighteen
Revision of Lecture Eighteen Previous lecture has discussed equalisation using Viterbi algorithm: Note similarity with channel decoding using maximum likelihood sequence estimation principle It also discusses
More informationMonitoring for Handover from TDD to GSM
Agenda Item: Source: Title: Document for: Siemens Monitoring for Handover from TDD to GSM Handover Preparation Monitoring for Handover from TDD to GSM The intention of this document is an explanation of
More informationEfficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation
Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau-638052 Venkatachalam.S Assistant Professor
More informationLog-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network
Recent Advances in Electrical Engineering and Electronic Devices Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network Ahmed El-Mahdy and Ahmed Walid Faculty of Information Engineering
More information6.02 Fall 2012 Lecture #5
6.2 Fall 22 Lecture #5 Error correction for linear block codes - Syndrome decoding Burst errors and interleaving 6.2 Fall 22 Lecture 5, Slide # Matrix Notation for Linear Block Codes Task: given k-bit
More informationAlgorithms for Interference Sensing in Optical CDMA Networks
Algorithms for Interference Sensing in Optical CDMA Networks Purushotham Kamath, Joseph D. Touch and Joseph A. Bannister {pkamath, touch, joseph}@isi.edu Information Sciences Institute, University of Southern
More informationGSM Frequency Planning with Band Segregation for the Broadcast Channel Carriers
GSM Frequency Planning with Band Segregation for the Broadcast Channel Carriers F. Galliano (1), N.P. Magnani (1), G. Minerva (1), A. Rolando (2), P. Zanini (3) (1) CSELT - Via G. Reiss Romoli, 274 - Torino
More informationPERFORMANCE AND EFFICIENCY EVALUATION OF CHANNEL ALLOCATION SCHEMES FOR HSCSD IN GSM
Generol Conference (Port B) PERFORMANCE AND EFFICIENCY EVALUATION OF CHANNEL ALLOCATION SCHEMES FOR HSCSD IN GSM Dayong Zhou and Moshe Zukerman Department of Electrical and Electronic Engineering The University
More informationTopology-Transparent Distributed Multicast and Broadcast Scheduling in Mobile Ad Hoc Networks
Topology-Transparent Distributed Multicast and Broadcast Scheduling in Mobile d Hoc Networks Yiming Liu, Victor O. K. Li, Ka-Cheong Leung, and Lin Zhang, Department of Electronic Engineering Tsinghua University,
More informationRESOURCE ALLOCATION FOR INTERACTIVE TRAFFIC CLASS OVER GPRS
RESOURCE ALLOCATION FOR INTERACTIVE TRAFFIC CLASS OVER GPRS Edward Nowicki and John Murphy 1 ABSTRACT The General Packet Radio Service (GPRS) is a new bearer service for GSM that greatly simplify wireless
More informationAN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS
AN ANALYSIS OF DELAY OF SMALL IP PACKETS IN CELLULAR DATA NETWORKS Hubert GRAJA, Philip PERRY and John MURPHY Performance Engineering Laboratory, School of Electronic Engineering, Dublin City University,
More informationAttenuation (amplitude of the wave loses strength thereby the signal power) Refraction Reflection Shadowing Scattering Diffraction
Wireless Physical Layer Q1. Is it possible to transmit a digital signal, e.g., coded as square wave as used inside a computer, using radio transmission without any loss? Why? It is not possible to transmit
More informationWireless Home Networks based on a Hierarchical Bluetooth Scatternet Architecture
Wireless Home Networks based on a Hierarchical Bluetooth Scatternet Architecture W. Lilakiatsakun'. 2, A. Seneviratne' I School of Electrical Engineering and Telecommunication University of New South Wales,
More informationPerformance modelling of hierarchical cellular networks using PEPA
Performance Evaluation 50 (2002) 83 99 Performance modelling of hierarchical cellular networks using PEPA J.M. Fourneau, L. Kloul, F. Valois Laboratoire PRiSM, Université de Versailles, 45, Av. des Etats-Unis,
More informationCDMA TECHNOLOGY. Brief Working of CDMA
CDMA TECHNOLOGY History of CDMA The Cellular Challenge The world's first cellular networks were introduced in the early 1980s, using analog radio transmission technologies such as AMPS (Advanced Mobile
More informationBluetooth voice and data performance in 802.11 DS WLAN environment
1 (1) Bluetooth voice and data performance in 802.11 DS WLAN environment Abstract In this document, the impact of a 20dBm 802.11 Direct-Sequence WLAN system on a 0dBm Bluetooth link is studied. A typical
More informationFrequency Hopping Spread Spectrum PHY of the 802.11 Wireless LAN Standard. Why Frequency Hopping?
Frequency Hopping Spread Spectrum PHY of the 802.11 Wireless LAN Standard Presentation to IEEE 802 March 11, 1996 Naftali Chayat BreezeCom 1 Why Frequency Hopping? Frequency Hopping is one of the variants
More informationThe mathematics of RAID-6
The mathematics of RAID-6 H. Peter Anvin 1 December 2004 RAID-6 supports losing any two drives. The way this is done is by computing two syndromes, generally referred P and Q. 1 A quick
More informationEPL 657 Wireless Networks
EPL 657 Wireless Networks Some fundamentals: Multiplexing / Multiple Access / Duplex Infrastructure vs Infrastructureless Panayiotis Kolios Recall: The big picture... Modulations: some basics 2 Multiplexing
More informationDynamic Reconfiguration & Efficient Resource Allocation for Indoor Broadband Wireless Networks
Dynamic Reconfiguration & Efficient Resource Allocation for Indoor Broadband Wireless Networks Tim Farnham, Brian Foxon* Home Communications Department HP Laboratories Bristol HPL-98-123 June, 1998 broadband,
More informationDeployment of Multi-layer TDMA Cellular Network with Distributed Coverage for Traffic Capacity Enhancement
Deployment of Multi-layer TDMA Cellular Network with Distributed Coverage for Traffic Capacity Enhancement Jérôme Brouet, Patrick Charrière, Vinod Kumar* Armelle Wautier, Jacques Antoine** *Alcatel, Corporate
More informationAssessment of Cellular Planning Methods for GSM
Assessment of Cellular Planning Methods for GSM Pedro Assunção, Rui Estevinho and Luis M. Correia Instituto das Telecomunicações/Instituto Superior Técnico, Technical University of Lisbon Av. Rovisco Pais,
More informationHow To Write A Hexadecimal Program
The mathematics of RAID-6 H. Peter Anvin First version 20 January 2004 Last updated 20 December 2011 RAID-6 supports losing any two drives. syndromes, generally referred P and Q. The way
More informationNOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS
NOVEL PRIORITISED EGPRS MEDIUM ACCESS REGIME FOR REDUCED FILE TRANSFER DELAY DURING CONGESTED PERIODS D. Todinca, P. Perry and J. Murphy Dublin City University, Ireland ABSTRACT The goal of this paper
More informationFAREY FRACTION BASED VECTOR PROCESSING FOR SECURE DATA TRANSMISSION
FAREY FRACTION BASED VECTOR PROCESSING FOR SECURE DATA TRANSMISSION INTRODUCTION GANESH ESWAR KUMAR. P Dr. M.G.R University, Maduravoyal, Chennai. Email: geswarkumar@gmail.com Every day, millions of people
More informationLecture 1. Introduction to Wireless Communications 1
896960 Introduction to Algorithmic Wireless Communications Lecture 1. Introduction to Wireless Communications 1 David Amzallag 2 May 25, 2008 Introduction to cellular telephone systems. How a cellular
More informationCS263: Wireless Communications and Sensor Networks
CS263: Wireless Communications and Sensor Networks Matt Welsh Lecture 4: Medium Access Control October 5, 2004 2004 Matt Welsh Harvard University 1 Today's Lecture Medium Access Control Schemes: FDMA TDMA
More informationLecture overview. History of cellular systems (1G) GSM introduction. Basic architecture of GSM system. Basic radio transmission parameters of GSM
Lecture overview History of cellular systems (1G) GSM introduction Basic architecture of GSM system Basic radio transmission parameters of GSM Analogue cellular systems 70 s In the early 70 s radio frequencies
More informationNotes 11: List Decoding Folded Reed-Solomon Codes
Introduction to Coding Theory CMU: Spring 2010 Notes 11: List Decoding Folded Reed-Solomon Codes April 2010 Lecturer: Venkatesan Guruswami Scribe: Venkatesan Guruswami At the end of the previous notes,
More informationMultiple Access Techniques
Chapter 8 Multiple Access Techniques Multiple access techniques are used to allow a large number of mobile users to share the allocated spectrum in the most efficient manner. As the spectrum is limited,
More informationFactoring Algorithms
Institutionen för Informationsteknologi Lunds Tekniska Högskola Department of Information Technology Lund University Cryptology - Project 1 Factoring Algorithms The purpose of this project is to understand
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationA Novel Decentralized Time Slot Allocation Algorithm in Dynamic TDD System
A Novel Decentralized Time Slot Allocation Algorithm in Dynamic TDD System Young Sil Choi Email: choiys@mobile.snu.ac.kr Illsoo Sohn Email: sohnis@mobile.snu.ac.kr Kwang Bok Lee Email: klee@snu.ac.kr Abstract
More informationAPPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM
152 APPENDIX 1 USER LEVEL IMPLEMENTATION OF PPATPAN IN LINUX SYSTEM A1.1 INTRODUCTION PPATPAN is implemented in a test bed with five Linux system arranged in a multihop topology. The system is implemented
More informationAdaptive Equalization of binary encoded signals Using LMS Algorithm
SSRG International Journal of Electronics and Communication Engineering (SSRG-IJECE) volume issue7 Sep Adaptive Equalization of binary encoded signals Using LMS Algorithm Dr.K.Nagi Reddy Professor of ECE,NBKR
More informationAn Adaptive Decoding Algorithm of LDPC Codes over the Binary Erasure Channel. Gou HOSOYA, Hideki YAGI, Toshiyasu MATSUSHIMA, and Shigeichi HIRASAWA
2007 Hawaii and SITA Joint Conference on Information Theory, HISC2007 Hawaii, USA, May 29 31, 2007 An Adaptive Decoding Algorithm of LDPC Codes over the Binary Erasure Channel Gou HOSOYA, Hideki YAGI,
More informationDynamic Frequency Selection (DFS) and the 5GHz Unlicensed Band
Dynamic Frequency Selection (DFS) and the 5GHz Unlicensed Band by Mark Briggs, Principal Engineer, Elliott Laboratories- An NTS Company Note: This article combines the content from several papers released
More informationFrequency Hopping for GSM Base Station Tests with Signal Generators SME
Frequency Hopping for GSM Base Station Tests with Signal Generators SME Application Note 1GPAN28E A. Winter 07.95 Products: Signal Generator SME Software Package SME-K1 Introduction One of the problems
More informationPositioning in GSM. Date: 14th March 2003
Positioning in GSM Date: 14th March 2003 Overview of seminar Potential applications in cellular network Review of localization system and techniques Localization in GSM system Progress of the project with
More informationPacket Queueing Delay in Wireless Networks with Multiple Base Stations and Cellular Frequency Reuse
Packet Queueing Delay in Wireless Networks with Multiple Base Stations and Cellular Frequency Reuse Abstract - Cellular frequency reuse is known to be an efficient method to allow many wireless telephone
More informationFunctional-Repair-by-Transfer Regenerating Codes
Functional-Repair-by-Transfer Regenerating Codes Kenneth W Shum and Yuchong Hu Abstract In a distributed storage system a data file is distributed to several storage nodes such that the original file can
More informationRadio Resource Allocation in GSM/GPRS Networks
Radio Resource Allocation in GSM/GPRS Networks Jean-Lien C. Wu 1, Wei-Yeh Chen 2, and Hung-Huan Liu 1 1 Department of Electronic Engineering, National Taiwan University of Science and Technology, 43, Keelung
More informationInter-cell Interference Mitigation Reduction in LTE Using Frequency Reuse Scheme
International Journal of Scientific and Research Publications, Volume 5, Issue 8, August 2015 1 Inter-cell Interference Mitigation Reduction in LTE Using Frequency Reuse Scheme Rupali Patil 1, R.D.Patane
More informationFrequency Assignment in Mobile Phone Systems
Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARTIN GRÖTSCHEL Frequency Assignment in Mobile Phone Systems ZIB-Report 00-58 (Dezember 2000) Frequency Assignment
More informationA! Aalto University Comnet
NETS2020 Project Task #2.3: Self-organization in Dynamic Networks Olav Tirkkonen, Jyri Hämäläinen 1 Content Subtask #2.3.1: Convergence of Distributed Network Algorithms: The project outcome Subtask #2.3.2:
More informationRapid Prototyping of a Frequency Hopping Ad Hoc Network System
Rapid Prototyping of a Frequency Hopping Ad Hoc Network System Martin Braun, Nico Otterbach, Jens Elsner, and Friedrich K. Jondral Communications Engineering Lab, Karlsruhe Institute of Technology (KIT),
More informationCHAPTER 1 1 INTRODUCTION
CHAPTER 1 1 INTRODUCTION 1.1 Wireless Networks Background 1.1.1 Evolution of Wireless Networks Figure 1.1 shows a general view of the evolution of wireless networks. It is well known that the first successful
More informationWhite Paper: Microcells A Solution to the Data Traffic Growth in 3G Networks?
White Paper: Microcells A Solution to the Data Traffic Growth in 3G Networks? By Peter Gould, Consulting Services Director, Multiple Access Communications Limited www.macltd.com May 2010 Microcells were
More informationPART 5D TECHNICAL AND OPERATING CHARACTERISTICS OF MOBILE-SATELLITE SERVICES RECOMMENDATION ITU-R M.1188
Rec. ITU-R M.1188 1 PART 5D TECHNICAL AND OPERATING CHARACTERISTICS OF MOBILE-SATELLITE SERVICES Rec. ITU-R M.1188 RECOMMENDATION ITU-R M.1188 IMPACT OF PROPAGATION ON THE DESIGN OF NON-GSO MOBILE-SATELLITE
More informationImage Compression through DCT and Huffman Coding Technique
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul
More informationDAB + The additional audio codec in DAB
DAB + The additional audio codec in DAB 2007 Contents Why DAB + Features of DAB + Possible scenarios with DAB + Comparison of DAB + and DMB for radio services Performance of DAB + Status of standardisation
More informationWhat is DECT? DECT stands for Digital Enhanced Cordless Telecommunications.
DECT 6.0 vs 900 MHz vs 2.4GHz vs 5.8 GHz DECT 6.0 (1.9 GHz) 900 MHz 2.4 GHz 5.8 GHz FCC approved frequency for cordless telecommunication Baby monitors, microwave oven Wi-Fi electronics (routers), wireless
More informationA SIMULATION STUDY ON SPACE-TIME EQUALIZATION FOR MOBILE BROADBAND COMMUNICATION IN AN INDUSTRIAL INDOOR ENVIRONMENT
A SIMULATION STUDY ON SPACE-TIME EQUALIZATION FOR MOBILE BROADBAND COMMUNICATION IN AN INDUSTRIAL INDOOR ENVIRONMENT U. Trautwein, G. Sommerkorn, R. S. Thomä FG EMT, Ilmenau University of Technology P.O.B.
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationImplementation of Mobile Measurement-based Frequency Planning in GSM
Implementation of Mobile Measurement-based Frequency Planning in GSM Comp.Eng. Serkan Kayacan (*), Prof. Levent Toker (**) (*): Ege University, The Institute of Science, Computer Engineering, M.S. Student
More informationMOST error-correcting codes are designed for the equal
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 3, MARCH 2007 387 Transactions Letters Unequal Error Protection Using Partially Regular LDPC Codes Nazanin Rahnavard, Member, IEEE, Hossein Pishro-Nik,
More informationMobile Communications TCS 455
Mobile Communications TCS 455 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 26 1 Office Hours: BKD 3601-7 Tuesday 14:00-16:00 Thursday 9:30-11:30 Announcements Read the following from the SIIT online
More informationPassive Discovery Algorithms
t t Technische Universität Berlin Telecommunication Networks Group arxiv:1506.05255v1 [cs.ni] 17 Jun 2015 Optimized Asynchronous Passive Multi-Channel Discovery of Beacon-Enabled Networks Niels Karowski,
More informationHow To Recognize Voice Over Ip On Pc Or Mac Or Ip On A Pc Or Ip (Ip) On A Microsoft Computer Or Ip Computer On A Mac Or Mac (Ip Or Ip) On An Ip Computer Or Mac Computer On An Mp3
Recognizing Voice Over IP: A Robust Front-End for Speech Recognition on the World Wide Web. By C.Moreno, A. Antolin and F.Diaz-de-Maria. Summary By Maheshwar Jayaraman 1 1. Introduction Voice Over IP is
More informationA Neighborhood Awareness Method for Handoff Assistance in 802.11 Wireless Networks
A Neighborhood Awareness Method for Handoff Assistance in 802.11 Wireless Networks Gurpal Singh *, Ajay Pal Singh Atwal ** and B.S. Sohi *** * Deptt of CSE & IT, BBSBEC, Fatehgarh Sahib, Punjab, India,
More informationMultiuser Communications in Wireless Networks
Multiuser Communications in Wireless Networks Instructor Antti Tölli Centre for Wireless Communications (CWC), University of Oulu Contact e-mail: antti.tolli@ee.oulu.fi, tel. +358445000180 Course period
More informationMASTER'S THESIS. Improved Power Control for GSM/EDGE
MASTER'S THESIS 2005:238 CIV Improved Power Control for GSM/EDGE Fredrik Hägglund Luleå University of Technology MSc Programmes in Engineering Department of Computer Science and Electrical Engineering
More informationNetwork Security. Chapter 6 Random Number Generation. Prof. Dr.-Ing. Georg Carle
Network Security Chapter 6 Random Number Generation Prof. Dr.-Ing. Georg Carle Chair for Computer Networks & Internet Wilhelm-Schickard-Institute for Computer Science University of Tübingen http://net.informatik.uni-tuebingen.de/
More informationData Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine
Data Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine Virtual communication versus actual communication: Specific functions
More informationDynamic Load Balance Algorithm (DLBA) for IEEE 802.11 Wireless LAN
Tamkang Journal of Science and Engineering, vol. 2, No. 1 pp. 45-52 (1999) 45 Dynamic Load Balance Algorithm () for IEEE 802.11 Wireless LAN Shiann-Tsong Sheu and Chih-Chiang Wu Department of Electrical
More informationPlanning of UMTS Cellular Networks for Data Services Based on HSDPA
Planning of UMTS Cellular Networks for Data Services Based on HSDPA Diana Ladeira, Pedro Costa, Luís M. Correia 1, Luís Santo 2 1 IST/IT Technical University of Lisbon, Lisbon, Portugal 2 Optimus, Lisbon,
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationINTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena *1, K. Upendra Chowdary 2
ISSN 2277-2685 IJESR/June 2014/ Vol-4/Issue-6/333-337 Y. Naveena et al./ International Journal of Engineering & Science Research INTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena
More informationAdaptive Linear Programming Decoding
Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006
More informationFactoring & Primality
Factoring & Primality Lecturer: Dimitris Papadopoulos In this lecture we will discuss the problem of integer factorization and primality testing, two problems that have been the focus of a great amount
More informationAn Algorithm for Automatic Base Station Placement in Cellular Network Deployment
An Algorithm for Automatic Base Station Placement in Cellular Network Deployment István Törős and Péter Fazekas High Speed Networks Laboratory Dept. of Telecommunications, Budapest University of Technology
More informationETSI TS 100 912 V8.4.0 (2000-08)
TS 100 912 V8.4.0 (2000-08) Technical Specification Digital cellular telecommunications system (Phase 2+); Radio subsystem synchronization (GSM 05.10 version 8.4.0 Release 1999) GLOBAL SYSTEM FOR MOBILE
More informationCh 2.3.3 GSM PENN. Magda El Zarki - Tcom 510 - Spring 98
Ch 2.3.3 GSM In the early 80 s the European community decided to work together to define a cellular system that would permit full roaming in all countries and give the network providers freedom to provide
More informationNon-Data Aided Carrier Offset Compensation for SDR Implementation
Non-Data Aided Carrier Offset Compensation for SDR Implementation Anders Riis Jensen 1, Niels Terp Kjeldgaard Jørgensen 1 Kim Laugesen 1, Yannick Le Moullec 1,2 1 Department of Electronic Systems, 2 Center
More informationFigure 1: cellular system architecture
Question 1: (30 marks) Consider a FDM cellular system with 120 cites, a frequency reuse factor of N=12, and 900 overall two-way channels. Omni-directional antennas are used: Figure 1 shows some of the
More informationNEW applications of wireless multi-hop networks, such
870 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 17, NO. 3, JUNE 2009 Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks Petar Djukic, Member, IEEE, and Shahrokh Valaee, Senior Member, IEEE
More informationA Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks
A Power Efficient QoS Provisioning Architecture for Wireless Ad Hoc Networks Didem Gozupek 1,Symeon Papavassiliou 2, Nirwan Ansari 1, and Jie Yang 1 1 Department of Electrical and Computer Engineering
More informationCOMPATIBILITY STUDY FOR UMTS OPERATING WITHIN THE GSM 900 AND GSM 1800 FREQUENCY BANDS
Electronic Communications Committee (ECC) within the European Conference of Postal and Telecommunications Administrations (CEPT) COMPATIBILITY STUDY FOR UMTS OPERATING WITHIN THE GSM 900 AND GSM 1800 FREQUENCY
More informationSeamless Congestion Control over Wired and Wireless IEEE 802.11 Networks
Seamless Congestion Control over Wired and Wireless IEEE 802.11 Networks Vasilios A. Siris and Despina Triantafyllidou Institute of Computer Science (ICS) Foundation for Research and Technology - Hellas
More informationIntroductory Concepts
Chapter 1 Introductory Concepts 1.1 Introduction Communication is one of the integral parts of science that has always been a focus point for exchanging information among parties at locations physically
More informationGSM System. Global System for Mobile Communications
GSM System Global System for Mobile Communications Introduced in 1991. Settings of standards under ETSI (European Telecommunication Standards Institute) Services - Telephone services - Data services -
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationOutline. Computer Science 418. Digital Signatures: Observations. Digital Signatures: Definition. Definition 1 (Digital signature) Digital Signatures
Outline Computer Science 418 Digital Signatures Mike Jacobson Department of Computer Science University of Calgary Week 12 1 Digital Signatures 2 Signatures via Public Key Cryptosystems 3 Provable 4 Mike
More informationTABLE OF CONTENTS. Dedication. Table of Contents. Preface. Overview of Wireless Networks. vii 1.1 1.2 1.3 1.4 1.5 1.6 1.7. xvii
TABLE OF CONTENTS Dedication Table of Contents Preface v vii xvii Chapter 1 Overview of Wireless Networks 1.1 1.2 1.3 1.4 1.5 1.6 1.7 Signal Coverage Propagation Mechanisms 1.2.1 Multipath 1.2.2 Delay
More informationHow To Understand And Understand The Power Of A Cdma/Ds System
CDMA Technology : Pr. Dr. W. Skupin www.htwg-konstanz.de Pr. S. Flament www.greyc.fr/user/99 On line Course on CDMA Technology CDMA Technology : Introduction to Spread Spectrum Technology CDMA / DS : Principle
More informationPerformance of networks containing both MaxNet and SumNet links
Performance of networks containing both MaxNet and SumNet links Lachlan L. H. Andrew and Bartek P. Wydrowski Abstract Both MaxNet and SumNet are distributed congestion control architectures suitable for
More informationIN current film media, the increase in areal density has
IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 1, JANUARY 2008 193 A New Read Channel Model for Patterned Media Storage Seyhan Karakulak, Paul H. Siegel, Fellow, IEEE, Jack K. Wolf, Life Fellow, IEEE, and
More informationChannel assignment for GSM half-rate and full-rate traffic
Computer Communications 23 (2000) 476 482 www.elsevier.com/locate/comcom Channel assignment for GSM half-rate and full-rate traffic P. Lin, Y.-B. Lin* Department of Computer Science and Information Engineering,
More informationYu.M. Tulyakov, D.Ye. Shakarov, A.A. Kalashnikov. Keywords: Data broadcasting, cellular mobile systems, WCDMA, GSM.
Аnalysis of data broadcasting in modern cellular mobile systems of ground radio communications Yu.M. Tulyakov, D.Ye. Shakarov, A.A. Kalashnikov At the analysis of channel formation in WCDMA networks the
More informationModule 5. Broadcast Communication Networks. Version 2 CSE IIT, Kharagpur
Module 5 Broadcast Communication Networks Lesson 9 Cellular Telephone Networks Specific Instructional Objectives At the end of this lesson, the student will be able to: Explain the operation of Cellular
More informationPossible Applications
FRAUNHOFER Institute for integrated circuits iis DECT Wireless Voice and Data Communications DECT stands for Digital Enhanced Cordless Telecommunication and is an accepted standard in more than 100 countries.
More informationPerformance Issues of TCP and MPEG-4 4 over UMTS
Performance Issues of TCP and MPEG-4 4 over UMTS Anthony Lo A.Lo@ewi.tudelft.nl 1 Wiskunde end Informatica Outline UMTS Overview TCP and MPEG-4 Performance Summary 2 1 Universal Mobile Telecommunications
More information1 Introduction to mobile telecommunications
1 Introduction to mobile telecommunications Mobile phones were first introduced in the early 1980s. In the succeeding years, the underlying technology has gone through three phases, known as generations.
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More informationLoad Balancing in MapReduce Based on Scalable Cardinality Estimates
Load Balancing in MapReduce Based on Scalable Cardinality Estimates Benjamin Gufler 1, Nikolaus Augsten #, Angelika Reiser 3, Alfons Kemper 4 Technische Universität München Boltzmannstraße 3, 85748 Garching
More informationSecure Authentication of Distributed Networks by Single Sign-On Mechanism
Secure Authentication of Distributed Networks by Single Sign-On Mechanism Swati Sinha 1, Prof. Sheerin Zadoo 2 P.G.Student, Department of Computer Application, TOCE, Bangalore, Karnataka, India 1 Asst.Professor,
More informationSECRET sharing schemes were introduced by Blakley [5]
206 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 1, JANUARY 2006 Secret Sharing Schemes From Three Classes of Linear Codes Jin Yuan Cunsheng Ding, Senior Member, IEEE Abstract Secret sharing has
More informationUnlicensed Mobile Access (UMA) Handover and Packet Data Performance Analysis
Unlicensed Mobile Access (UMA) Handover and Packet Data Performance Analysis Andres Arjona Nokia Siemens Networks andres.arjona@nsn.com Hannu Verkasalo Helsinki University of Technology hannu.verkasalo@tkk.fi
More informationGSM GSM 05.02 TECHNICAL May 1996 SPECIFICATION Version 5.0.0
GSM GSM 05.02 TECHNICAL May 1996 SPECIFICATION Version 5.0.0 Source: ETSI TC-SMG Reference: TS/SMG-020502Q ICS: 33.060.50 Key words: Digital cellular telecommunications system, Global System for Mobile
More information