【24h】

Will This Rover Site Make The Path?

机译:这个漫游者站点会走这条路吗?

获取原文
获取原文并翻译 | 示例

摘要

Roving has been getting more and more popular in VHF contesting in recent years. Right after getting some equipment together, the very next question is "Where do I setup"? Now there are lots of strategies for choosing the general areas from which to operate to maximize one's score, but this paper will concentrate on the mechanics of picking the very best site in an area to make a specific path. I will admit right at the start, there is no new science in this paper. Rather, by combining one of a number of inexpensive mapping programs that have become available in recent years with an old troposcatter link calculation program, we can take a lot of the guessing out of selecting a rover site. The process for calculating how loud the signals will be along a link between 2 stations was very well described by Bob Atkins KA1GT in his article in Communications Quarterly. Although quite some time has passed since Bob's article was published, I have seen very little discussion in the amateur literature about path prediction. I guess we all like to JUST TRY IT and see if it works!.... Figuring it out first? Some will say that just takes all the fun out of it! Well, I'm sorry. I don't agree. I think we can save ourselves a lot of time and effort if we take a stab at doing some calculations first At least, we can improve our chances by selecting the best site in that new grid, even if we don't want to believe the numbers. Further, even if we don't want to go through all that trouble with each site and each path, then at least going through the process a few times will acquaint us with what really matters in site selection.
机译:近年来,巡回赛在VHF比赛中越来越受欢迎。将一些设备放在一起后,下一个问题是“我在哪里安装”?现在,有很多策略可以选择总体操作区域,以最大程度地提高自己的得分,但是本文将重点介绍在区域中选择最佳站点以制定特定路径的机制。我将在一开始就承认,本文没有新科学。相反,通过将近年来可用的许多廉价映射程序之一与旧的对流散射链路计算程序相结合,我们可以从选择流动站的过程中获得很多猜测。鲍勃·阿特金斯(Bob Atkins)KA1GT在其《通讯季刊》中的文章中很好地描述了计算信号沿两个站点之间的链接的响度的过程。尽管自鲍勃的文章发表以来已经过去了很多时间,但我在业余文献中几乎没有关于路径预测的讨论。我猜我们大家都喜欢尝试一下,看看它是否有效!....首先弄清楚吗?有人会说,只是把所有的乐趣都带走了!好,对不起。我不同意我认为,如果我们先尝试进行一些计算,就可以节省很多时间和精力。至少,即使我们不想相信这样做,也可以通过在新网格中选择最佳站点来提高机会。数字。此外,即使我们不想在每个站点和每个路径上都遇到麻烦,但是至少要经历几次该过程才能使我们熟悉站点选择中真正重要的内容。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号