Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 1 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: Proposal for merging mode H and mode L of AFH Date Submitted: August 6, 2001 Source: (1) HK Chen, YC Maa, and KC Chen (2) Anuj Batra, Kofi Anim-Appiah, and Jin-Meng Ho Company: (1) Integrated Programmable Communications, Inc. (2) Texas Instruments, Inc. Address:(1)Taiwan Laboratories Address: P.O. Box , Hsinchu, Taiwan 300 (2) TI Boulevard, Dallas, TX TEL(1) , FAX: , {hkchen, ycmaa, (2) , FAX: , {batra, kofi, Re: [] Abstract:This presentation shows why mode H is a superset of mode L and suggests how to merge them. Purpose:Submission to Task Group 2 for consideration as the baseline for merging mode H and mode L of AFH in response to the action item of the July-01 meeting. Notice:This document has been prepared to assist the IEEE P It is offered as a basis for discussion and is not binding on the contributing individual(s) or organization(s). The material in this document is subject to change in form and content after further study. The contributor(s) reserve(s) the right to add, amend or withdraw material contained herein. Release:The contributor acknowledges and accepts that this contribution becomes the property of IEEE and may be made publicly available by P

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 2 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Proposal for Merging Mode H and Mode L of AFH HK Chen, YC Maa, and KC Chen Integrated Programmable Communications Anuj Batra, Kofi Anim-Appiah, and Jin-Meng Ho Texas Instruments

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 3 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Channel classification terminology Old terminologies: Mode H: good/bad/unused channels Mode L: good/bad channels New terminologies: S G : the set of good channels, N G =size(S G ) S B : the set of bad channels, N B =size(S B ) S BK : the set of bad channels kept in the new hopping sequence, N BK =size(S BK ) S BN : the set of bad channels not used in the new hopping sequence, N BN =size(S BN ) N: total number of channels

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 4 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Channel classification terminology (2) SGSG S BN S BK S B =S BK U S BN N=N G +N B N B =N BK +N BN

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 5 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. On the numbers N min : minimal number of channels in the new hopping sequence BBN BK BN GBK G NN N otherwise N NN N NN NNif 0 min When N G is large enough, no bad channels are used in the new hopping sequence. This is where mode H reduces to mode L.

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 6 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Block diagram of mode L mapping f gen Mod NGNG f adp XLXL YLYL bank of good channels 1 0 Top path: the bad channels are replaced by good channels Bottom path: bypass if original channel is already good f gen : hopping sequence before doing AFH f adp : hopping sequence after mapping X L : shifting signal of mode L to equalize channel utilization Y L : bypass control signal of mode L SGSG

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 7 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Block diagram of mode H mapping f gen NGNG.SG...SG.. f adp XHXH bank of good channels bank of bad channels kept 10 N BK YHYH 1 0 p seq The black parts have exactly the same structure as mode L Top path: the bad channels are replaced by good channels Middle path: the good channels are replaced by bad channels Mod 1 0 Bottom path: bypass if original channel is already in the desired set specified by p seq X H : shifting signal of mode H to equalize channel utilization Y H : bypass control signal of mode H p seq : partition sequence specifying using S G or S BK S BK

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 8 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. When will mode H reduce to mode L? (1) Mathematically, mode H reduces to mode L when three conditions holds: 1.p seq = 1 Do not select the middle path in mode H 2.X H =X L The two modes have the same shifting signal 3.Y H =Y L The two modes switch to the bypass path (bottom path) in the same way

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 9 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. When will mode H reduce to mode L? (2) Partition sequence p seq =1 => select S G, p seq =0 => select S BK When good channels are enough ( ) Mode H sets N BK =0. The second channel bank S BK becomes empty and is not used. p seq becomes a constant 1, and the middle path of mode H is never selected. Thus the first condition is satisfied.

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 10 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. When will mode H reduce to mode L? (3) Shifting signal (X H and X L ) The shifting signal is added to make the selection probability of each channel in the banks uniform. Mode H and L can (and are desired to) share the same shifting signal. Thus the second condition is satisfied.

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 11 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. When will mode H reduce to mode L? (4) Bypass control signal (Y H and Y L ) Eqs: Mode H bypass occurs when: p seq = 1 and original hopping channel is in S G. p seq = 0 and original hopping channel is in S BK. When there are enough good channels: The bank of S BK is never selected. Mode H bypass reduces to mode L bypass. Thus the third condition is satisfied. It is easily seen that Y L = Y H if p seq =1.

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 12 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Mode H : a superset of Mode L When there are enough good channels: mode H performs the same operation as mode L. In this case, both modes support all types of traffic. In this case, both modes support broadcast packets to the same degree. When there are not enough good channels: Mode H keeps some of the bad channels in the new hopping sequence to meet minimal channel number requirement. Mode H properly arranges the position of bad channel slots to support all types of traffic and QoS.

Integrated Programmable Communications, Inc. August, 2001 doc.: IEEE /382r0 Submission Slide 13 Integrated Programmable Communications, Inc. and Texas Instruments, Inc. Direction to merge Since the function of mode L mapping is already included in mode H mapping, we suggest to use the block diagram of mode H mapping as the basis of merging. One common shifting signal should be determined for both modes. The LMP procedures and commands require further considerations.