Radar and Communication Spectral Coexistence on Moving Platform with Interference Suppression
2
Citation
50
Reference
10
Related Paper
Citation Trend
Abstract:
With the development of intelligent transportation, radar and communication on moving platforms are competing for the spectrum. In this paper, we propose and demonstrate a new algorithmic framework for radar-communication spectral coexistence system on moving platform with mutual interference suppression, in which communication rate and the radar signal-to-interference-plus-noise ratio (SINR) are simultaneously optimized, under the energy constraints for the two systems and the radar constant modulus constraint. The radar spatial-temporal filter at the receiver and transmitting waveform are optimized, while the codebook matrix is optimized for the communication system. To cope with the established non-convex problem with triplet variables, we decouple the original problem into multiple subproblems, for which an alternating algorithm based on iterative procedures is derived with lower computational complexity. Specifically, the subproblems of communication codebook and radar filter design are convex and the closed-form solutions can be easily obtained, while the radar waveform optimization is non-convex. Then we propose a novel scheme by exploiting the alternating direction method of multipliers (ADMM) based on minorization-maximization (MM) framework. Finally, to reveal the effectiveness of the proposed algorithm in different scenarios, numerical results are provided.Keywords:
Maximization
This paper proposes a novel codebook for multiuser multiple-input multiple-output systems under spatially correlated channels. Existing codebooks designed for correlated channels either require accurate channel statistics which is not favorable for practical systems, or only perform well in highly correlated channels. In this paper, we first analyze the per-user rate loss led by using DFT codebook, then propose a two-level codebook, named weighted DFT codebook. It consists of a DFT-based codebook and a Grassmannian linear packing codebook. The proposed scheme does not need accurate channel statistics and can adapt to both correlated and uncorrelated scenarios. Simulation results show significant performance gain of the proposed codebook over the existing codebooks in various correlated channels.
Linde–Buzo–Gray algorithm
Uncorrelated
Cite
Citations (7)
A novel differential codebook, preserving inherent properties of 3GPP long-term evolution (LTE) codebooks, is proposed for temporally correlated channels. The steady-state achievable throughput performance of the proposed codebook shows at least 0.9 dB of SNR better than that of the conventional LTE codebook with the same amount of feedback information.
Linde–Buzo–Gray algorithm
Lock (firearm)
Cite
Citations (7)
This paper discusses the algorithms of codebook generation in SCHMM based speech recognition system and their fundamental principle. Introducing the basic discipline of Stochastic Relaxation- Division (SR-D) algorithm, it introduces the general idea into the authors' initial codebook generation algorithm. The experiment results show that the new method significantly improves the system performance. With the modified initial codebook, the model is further trained with the criterion of Maximum Likelihood(ML),which leads the codebook and other parameters more consistent and compatible.The effect of codebook size to final performance is also discussed and relative experiment results are presented.
Linde–Buzo–Gray algorithm
Cite
Citations (0)
The codebook design which determines the quality of the encoded images is an important problem in the vector quantisation technique. The Linde–Buzo–Gray (LBG) technique is a widely used algorithm in the codebook design. However, LBG algorithm is very sensitive to the initial codebook and tends to trap to the local minimum. In this study, a high‐quality initial codebook design method is proposed. The proposed method utilises both the mean characteristic value and variance characteristic value of training vectors to divide the training vectors into groups. Then codewords are selected from each group to generate an initial codebook. The experimental results demonstrate that the authors proposed method has a better performance in the initial codebook than that of the related methods.
Linde–Buzo–Gray algorithm
Cite
Citations (7)
Abstract Sparse code multiple access (SCMA) is an emerging technology developed to meet the requirements of 5G and 6G communications and improve the spectral efficiency of systems. The key behind SCMA technology is the design of its codebook method, particularly the design of the mother codebook method, which forms the basis of excellent user codebook design. Considering the limitations of existing mother codebook methods, a constellation evolution mother codebook design method is proposed here. Odd and even constellations are derived using the proposed method, and a multi-dimensional rotation angle is established. Then, the excellent mother constellations (mother codebook) are reconstructed. The proposed mother codebook design method demonstrates excellent performance in terms of the bit error rate and is found to be superior to existing codebook methods. It can provide a universal mother codebook for user codebooks, thus yielding excellent codebooks for efficient SCMA applications and establishing a technical basis for efficient 5G and 6G applications.
Linde–Buzo–Gray algorithm
Code (set theory)
Basis (linear algebra)
Cite
Citations (0)
In this paper, we introduce and analyze a practical codebook for single-antenna non-coherent communications, with codewords belonging to the Grassmannian of lines defined on the complex vector space. This codebook is structured and has zero storage requirement. It has higher packing efficiency, represented by the minimum distance, than other structured codebooks in the literature. Numerical results show that this codebook outperforms the training-based scheme in terms of error probability and achievable rate.
Linde–Buzo–Gray algorithm
Cite
Citations (9)
Linde–Buzo–Gray algorithm
Zero-forcing precoding
Cite
Citations (0)
Waveforms should be synthesized efficiently according to different environment with the development of modern technology. In this paper, based on the mutual information definition of transmitted waveform, discrete optimization model is proposed. Convex optimization method is used to design the transmitted waveform. The simulation results demonstrate the validity of our algorithm.
Cite
Citations (1)
Visual codebook has been popular in object classification as well as action analysis. However, its performance is often sensitive to the codebook size that is usually predefined. Moreover, the codebook generated by unsupervised methods, e.g., K-means, often suffers from the problem of ambiguity and weak efficiency. In other words, the visual codebook contains a lot of noisy and/or ambiguous words. In this paper, we propose a novel method to address these issues by constructing a compact but effective visual codebook using sparse reconstruction. Given a large codebook generated by K-means, we reformulate it in a sparse manner, and learn the weight of each word in the original visual codebook. Since the weights are sparse, they naturally introduce a new compact codebook. We apply this compact codebook to action recognition tasks and verify it on the widely used Weizmann action database. The experimental results show clearly the benefits of the proposed solution.
Linde–Buzo–Gray algorithm
Cite
Citations (4)
Codebook design is important part of speaker recognition, and it is important research direction how to fast realize precise codebook design. Currently, there are two research methods. They are codebook design methods based on local optimization algorithms and global optimization algorithms. They have drawbacks to some extent for different speakers. Based on it, this paper proposed a double order hybrid optimum codebook design algorithm. This algorithm combines the two representative research methods, realize two codebook design algorithm based on GA (genetic algorithm) and LBG (linde-buzo-gray algorithm) +GA in parallel and obtain final optimum codebook by combination judgment. The experimental results show that, this algorithm can obtain better recognition accuracy and more stable recognition rate.
Linde–Buzo–Gray algorithm
Cite
Citations (0)