Extension of exactly orthogonal code for chaos CDMA (非線形問題)

スポンサーリンク

概要

• 論文の詳細を見る

• Exactly orthogonal codes are used for synchronous multiplexing in many mobile communication systems. Recently, a new exactly orthogonal code based on primitive roots of finite field (referred to as 'primitive root code' in the paper) is introduced but it has a limitation of code length being a prime number. This paper extends the primitive root code to circumvent the limitation of code length. It introduces a procedure to produce a new code from two primitive root codes and shows that the produced code also has exact orthogonality.

• 社団法人電子情報通信学会の論文
• 2008-12-02

著者

• Umeno Ken

  Next Generation Mobile Communications Laboratory Center For Intellectual Property Strategies Riken

• HORI Gen

  Next Generation Mobile Communications Laboratory, Center for Intellectual Property Strategies, RIKEN

• Hori Gen

  Next Generation Mobile Communications Laboratory Center For Intellectual Property Strategies Riken

• 梅野 健

  Next Generation Mobile Communications Laboratory, Center for Intellectual Property Strategies, RIKEN

関連論文

• Inner angle of triangle on unit circle made of consecutive three points generated by chaotic map
• Performance Analysis of Complex CDMA Using Complex Chaotic Spreading Sequence with Constant Power
• Performance Evaluation of Band-Limited Baseband Synchronous CDMA Using Orthogonal ICA Sequences
• Extension of exactly orthogonal code for chaos CDMA (非線形問題)

スポンサーリンク