1 / 33

FREQUENCY PLAN SYNTHESIS WHAT IT IS AND HOW IT WORKS THE BASICS

TERRY O’LEARY. FREQUENCY PLAN SYNTHESIS WHAT IT IS AND HOW IT WORKS THE BASICS. EBU TECHNICAL DEPARTMENT. PLAN SYNTHESIS. OVERVIEW. 1. The Problem 2. Beginning Concepts 3. Synthesis Methods 4. Inside the Computer 5. Summary. 1. THE PROBLEM. FREQUENCY ASSIGNMENT

helenas
Download Presentation

FREQUENCY PLAN SYNTHESIS WHAT IT IS AND HOW IT WORKS THE BASICS

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. TERRY O’LEARY FREQUENCY PLAN SYNTHESISWHAT IT IS AND HOW IT WORKSTHE BASICS EBU TECHNICAL DEPARTMENT

  2. PLAN SYNTHESIS OVERVIEW 1. The Problem 2. Beginning Concepts 3. Synthesis Methods 4. Inside the Computer 5. Summary

  3. 1. THE PROBLEM • FREQUENCY ASSIGNMENT • CAPACITY vs DESIRE • COMPATIBILITY vs CHAOS • MAGNITUDE vs MEANS

  4. THE PROBLEM RRC 04-05 • Large demand : > 10 000 (?) reqs • Small supply : < 450 MHz, 60 CHANNELS •  Frequency sharing / re-use • Interference potential DEFINITION OF PLAN SYNTHESIS: SYNTHESIS: PUTTING TOGETHER SEPARATE ELEMENTS INTO A CONNECTED WHOLE SEPARATE ELEMENTS: REQUIREMENTS, CHANNELS CONNECTED WHOLE :PLAN

  5. req B req A req C THE PROBLEM VISUALISED req D req G req H SHARING A LIMITED RESOURCE SPECTRUM BAND III  174 – 230 MHz BAND IV/V  470 – 862 MHz req E req F

  6. E (dB V/m) erp2, ht2 erp1, ht1 d (km) INTERFERENCE ZONE INTERFERENCE POTENTIAL CAN USE THE SAME CHANNEL CAN’T USE THE SAME CHANNEL

  7. 2. BEGINNING CONCEPTS • Interference Representations • A ‘Symple’ (partial*) Synthesis • * ‘ partial ’ meaning • ‘ in part ’ (because only started) • and/or • ‘ biased ’ (because done manually)

  8. INTERFERENCE REPRESENTATIONS: 1   ‘GRAPH’ REPRESENTATION SCHEMATIC LINES = INTERFERENCE NODES = TX NETWORK-INTERFERENCE REPRESENTATION

  9. d e a c b A ‘SYMPLE’ SYNTHESIS (aka Frequency Assignment) THIS IS A MANUAL SEQUENTIAL SYNTHESIS CH 1 CH 2 CH 3 CH 4

  10. 3. SYNTHESIS METHODS • Manual search • Size of the problem • Computer (aided) search • Exhaustive • Intensive • ‘Symple’ sequential

  11. ? ? A MESSY MANUAL MORASS? 4 channels 15 requirements THEN 6 CHANNELS WOULD BE NEEDED THEN 5 CHANNELS WOULD BE NEEDED FREQUENCY PLANNING 6 2 3 1 5 2 4 2 1 BUT WE ONLY HAVE 4 !! 4 2 4 3

  12. … … = 415 > 1 000 000 000 THE SIZE OF THE PROBLEM? 3 1 3 1 4 2 4 2 4 X 4 POSSIBLE PLANS MASTRICHT 2002 : 16 CHANNELS 2000 REQUIREMENTS = 162000 > 102400 So … An ‘exhaustive’ search is probably not practical ! POSSIBLE PLANS

  13. WHAT DOES THE COMPUTER DO? 4 2 1 4 2 4 2 1 3 1 4 3 1 3 2 ONLY 4 NEEDED!!

  14. 4. INSIDE THE COMPUTER • Importance of Assignment Order • Interference Representations: 2 • Sequential Ordering • Channel Selection

  15. FINISH 1  2 1 4 2 2 1 2 1 3 2 1 2 2 2 1 2 1 2 1 1 2 1 1 IMPORTANCE OF ASSIGNMENT ORDER 1 START 4 Blocks  2 Blocks

  16. 5 6 6 7 4 7 5 ? ? 3 1 4 1 2 2 3 IMPORTANCE OF ASSIGNMENT ORDER 2 ?= [ 8 ] ?= 2, 3, 4, 5, 6 7 Blocks Available LARGEST FIRST? SMALLEST LAST?

  17. INTERFERENCE REPRESENTATIONS: 2 H D C A G B E F I ‘MATRIX’ REPRESENTATION ‘1’ = interference ‘0’ = compatible ‘GRAPH’ REPRESENTATION

  18. I H E J F G D C B A ORDERING METHODS: DESCENDING • Descending • Largest First • Smallest Last

  19. I H E J F G D C B A ORDERING METHODS: LARGEST FIRST (1)

  20. I H (E) J F G D C B A ORDERING METHODS: LARGEST FIRST (2)

  21. I H (E) J F G D (C) B A ORDERING METHODS: LARGEST FIRST (3)

  22. I H (E) J F (G) D (C) B A ORDERING METHODS: LARGEST FIRST (4)

  23. I H (E) J F (G) D (C) B (A) ORDERING METHODS: LARGEST FIRST (5)

  24. I H (E) J (F) (G) D (C) B (A) ORDERING METHODS: LARGEST FIRST (6)

  25. I (H) (E) J (F) (G) D (C) B (A) ORDERING METHODS: LARGEST FIRST (7)

  26. I H E J F G D C B A ORDERING METHODS: SUMMARY • Descending • Largest First • Smallest Last

  27. CHANNEL SELECTION METHODS

  28. SEQUENTIAL SYNTHESIS METHODS

  29. 5. SUMMARY • Comparison • EBU Work • Conclusion

  30. [1 000 000 000 000 000 000 000 000 000 000 000 000 000 000 COMPARISON • ‘Manual’ methods : messy • ‘Exhaustive’ search : > 102400 • ‘Sequential’ search : fast, many available • ‘Intensive’ search* : lengthy?? • * “Simulated Annealing” , • “Great Deluge” , • “Ethereal Manifestation”, …

  31. ‘Grouped’ sequential algorithms ‘Forward’ algorithms ‘omniscient’ algorithm ‘Dynamic’ algorithms ‘Linear’ algorithms RRC’05 ? MA’02 ? WI’95 ? EBU SYNTHESIS PROGRAM NUMBER OUT  NUMBER IN 

  32. CONCLUSION • Possible philosophy of plan synthesis has been described • Possible steps in a synthesis procedure have been outlined Definitive procedures will be decided at RRC

  33. FREQUENCY PLAN SYNTHESIS • Terry O’Leary (Sept. 2003) NO MORE TIME THANK YOU!

More Related