2． 用循环链表解Josephus问题。设有n个人围坐在一个圆桌周围，现从第1个人开始报数，数到第m的人出列，然后从出列的下一个人重新开始报数，数到第m的人又出列，…，如此反复直到所有的人全部出列为止。Josephus问题是：对于任意给定的n和m，求出按出列次序得到的n个人员的序列-2. Josephus solution of the problem with the circulation list. With n individuals sitting around a round tab

Gold序列生成程序，用m序列模2相加生成平衡Gold序列-Gold sequence generation process, using mod 2 sum of m sequences generated balanced Gold sequences

SCFDE 包括导频，独特字cp,过瑞利信道，有m序列和chu序列两种。-SCFDE including the pilot, a unique word cp, over Rayleigh channel, there are two sequences and sequence m chu.