Hadamard codes of m≠2n in phase‐code multiplexed holographic memories

1996 ◽  
Vol 35 (12) ◽  
pp. 3639 ◽  
Author(s):  
Xiangyang Yang
Keyword(s):  
Phase Code ◽  
Holographic Memories ◽  
Hadamard Codes

Generation of Hadamard matrices for phase-code-multiplexed holographic memories

1996 ◽  
Vol 21 (14) ◽  
pp. 1067 ◽  
Author(s):  
Xiangyang Yang ◽  
Yu Xu ◽  
Zhiqing Wen
Keyword(s):  
Hadamard Matrices ◽  
Phase Code ◽  
Holographic Memories

Holographic Memories Using 2-Dimensional Phase-Code Multiplexing Method

2004 ◽  
Vol 43 (7B) ◽  
pp. 4954-4958 ◽  
Author(s):  
Megumi Ezura ◽  
Shigeyuki Baba ◽  
Nobuhiro Kihara
Keyword(s):  
Phase Code ◽  
Holographic Memories

Approaching low rate Shannon limit using concatenated Hadamard codes

2000 ◽  
Vol 36 (1) ◽  
pp. 45 ◽  
Author(s):  
W.K. Leung ◽  
K.S. Ho ◽  
Ping Li
Keyword(s):  
Hadamard Codes ◽  
Low Rate

scholarly journals Optimizing Transmit Sequence and Instrumental Variables Receiver for Dual-Function Complexity System

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Yu Yao ◽  
Junhui Zhao ◽  
Lenan Wu
Keyword(s):  
Approximate Solution ◽  
Instrumental Variables ◽  
Performance Index ◽  
Dual Function ◽  
Np Hard ◽  
Match Filter ◽  
Filter Output ◽  
Phase Code ◽  
Discrete Phase ◽  
Simulation Results

This correspondence deals with the joint cognitive design of transmit coded sequences and instrumental variables (IV) receive filter to enhance the performance of a dual-function radar-communication (DFRC) system in the presence of clutter disturbance. The IV receiver can reject clutter more efficiently than the match filter. The signal-to-clutter-and-noise ratio (SCNR) of the IV filter output is viewed as the performance index of the complexity system. We focus on phase only sequences, sharing both a continuous and a discrete phase code and develop optimization algorithms to achieve reasonable pairs of transmit coded sequences and IV receiver that fine approximate the behavior of the optimum SCNR. All iterations involve the solution of NP-hard quadratic fractional problems. The relaxation plus randomization technique is used to find an approximate solution. The complexity, corresponding to the operation of the proposed algorithms, depends on the number of acceptable iterations along with on and the complexity involved in all iterations. Simulation results are offered to evaluate the performance generated by the proposed scheme.

Sign in / Sign up

Export Citation Format

Share Document