文件名称:goldcode_seq_gen
-
所属分类:
- 标签属性:
- 上传时间:2013-06-03
-
文件大小:1.73kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
Gold code sequence generator
Run from editor Debug (F5)
JC 4/25/09
Gold code generation can sometimes be confusing and hopefully this m-file
will be helpful. The m-file uses two preferred pairs of m-sequences (length 2^n-1)
chips long where n=5 with length 31. The 33 gold codes
(two original m-sequences plus 2^n-1 gold codes) produced in a 31x33 matrix
here (with n=5) are probably not to useful for multiple access situations (CDMA)
but is used here to provide a model for learning. The preferred pair used
here is 52 and 5432 or 45 and 75 octal. Other preferred pairs can include values
such as 53 5321, 5431, and 5421. The m-file will also check the cross-correlation
values between any two codes in the matrix and should be three valued (-9,-1,7). The
autocorrelation of a Gold code can also be checked. Some, not all, of the
Gold codes in the matrix are balanced (16 1 s and 15 -1 s).
Run from editor Debug (F5)
JC 4/25/09
Gold code generation can sometimes be confusing and hopefully this m-file
will be helpful. The m-file uses two preferred pairs of m-sequences (length 2^n-1)
chips long where n=5 with length 31. The 33 gold codes
(two original m-sequences plus 2^n-1 gold codes) produced in a 31x33 matrix
here (with n=5) are probably not to useful for multiple access situations (CDMA)
but is used here to provide a model for learning. The preferred pair used
here is 52 and 5432 or 45 and 75 octal. Other preferred pairs can include values
such as 53 5321, 5431, and 5421. The m-file will also check the cross-correlation
values between any two codes in the matrix and should be three valued (-9,-1,7). The
autocorrelation of a Gold code can also be checked. Some, not all, of the
Gold codes in the matrix are balanced (16 1 s and 15 -1 s).
(系统自动生成,下载前可以参看下载内容)
下载文件列表
goldcode_seq_gen.m
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者,仅为网络服务对象提供信息存储空间,仅对用户上载内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。
