• Title/Summary/Keyword: Orthogonal Matrix

Search Result 268, Processing Time 0.028 seconds

Least squares decoding in binomial frequency division multiplexing

  • Myungsup Kim;Jiwon Jung;Ki-Man Kim
    • ETRI Journal
    • /
    • v.45 no.2
    • /
    • pp.277-290
    • /
    • 2023
  • This paper proposes a method that can reduce the complexity of a system matrix by analyzing the characteristics of a pseudoinverse matrix to receive a binomial frequency division multiplexing (BFDM) signal and decode it using the least squares (LS) method. The system matrix of BFDM can be expressed as a band matrix, and as this matrix contains many zeros, its amount of calculation when generating a transmission signal is quite small. The LS solution can be obtained by multiplying the received signal by the pseudoinverse matrix of the system matrix. The singular value decomposition of the system matrix indicates that the pseudoinverse matrix is a band matrix. The signal-to-interference ratio is obtained from their eigenvalues. Meanwhile, entries that do not contribute to signal generation are erased to enhance calculation efficiency. We decode the received signal using the pseudoinverse matrix and the removed pseudoinverse matrix to obtain the bit error rate performance and to analyze the difference.

Signal Processing Logic Implementation for Compressive Sensing Digital Receiver (압축센싱 디지털 수신기 신호처리 로직 구현)

  • Ahn, Woohyun;Song, Janghoon;Kang, Jongjin;Jung, Woong
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.4
    • /
    • pp.437-446
    • /
    • 2018
  • This paper describes the real-time logic implementation of orthogonal matching pursuit(OMP) algorithm for compressive sensing digital receiver. OMP contains various complex-valued linear algebra operations, such as matrix multiplication and matrix inversion, in an iterative manner. Xilinx Vivado high-level synthesis(HLS) is introduced to design the digital logic more efficiently. The real-time signal processing is realized by applying dataflow architecture allowing functions and loops to execute concurrently. Compared with the prior works, the proposed design requires 2.5 times more DSP resources, but 10 times less signal reconstruction time of $1.024{\mu}s$ with a vector of length 48 with 2 non-zero elements.

A Study on Cross-correlation Control Schemes on Walsh and Golay Codes Based on the Orthogonal Transformation and BER Performance Evaluation of Asynchronous CDMA System Using the Modified Codes (직교변환에 의한 Walsh 및 Golay 코드의 상호상관 제어방식과 수정된 코드를 사용한 비동기 CDMA 시스템의 비트오율 성능에 관한 연구)

  • Lee, Won-Chang;Kim, Myoung-Jin
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.4
    • /
    • pp.304-312
    • /
    • 2008
  • Orthogonal codes like Walsh and Golay codes may have large correlation value when they are not synchronized, hence they are seldom used in asynchronous CDMA systems. Wysocki[1] showed that by multiplying the original Walsh-Hadamard matrix with an orthogonal transformation matrix the resultant matrix sustains orthogonality between row vectors and their cross-correlation can be reduced. Soberly and Wysocki[2] proposed similar scheme on Golay codes. This implies that using the proper orthogonal transformation cross-correlation of Walsh and Golay codes can be reduced, and the transformed codes can be used for user separation in the CDAM reverse link. In this paper we discuss cross-correlation related parameters which affect the performance of an asynchronous CDMA link, and we investigate the correlation properties of the transformed codes. When we designed orthogonal transformation matrices for Walsh and Golay codes, we minimized the maximum value of aperiodic cross-correlation of the codes ($ACC_{max}$) or the mean square value of the aperiodic cross-correlation($R_{cc}$) with preserving the orthogonality of the modified codes. We also evaluate the asynchronous CDMA system that uses the transformed Walsh and Golay codes.

  • PDF

Joint Detection Method for Non-orthogonal Multiple Access System Based on Linear Precoding and Serial Interference Cancellation

  • Li, Jianpo;Wang, Qiwei
    • Journal of Information Processing Systems
    • /
    • v.17 no.5
    • /
    • pp.933-946
    • /
    • 2021
  • In the non-orthogonal multiple access (NOMA) system, multiple user signals on the single carrier are superimposed in a non-orthogonal manner, which results in the interference between non-orthogonal users and noise interference in the channel. To solve this problem, an improved algorithm combining regularized zero-forcing (RZF) precoding with minimum mean square error-serial interference cancellation (MMSE-SIC) detection is proposed. The algorithm uses RZF precoding combined with successive over-relaxation (SOR) method at the base station to preprocess the source signal, which can balance the effects of non-orthogonal inter-user interference and noise interference, and generate a precoded signal suitable for transmission in the channel. At the receiver, the MMSE-SIC detection algorithm is used to further eliminate the interference in the signal for the received superimposed signal, and reduce the calculation complexity through the QR decomposition of the matrix. The simulation results show that the proposed joint detection algorithm has good applicability to eliminate the interference of non-orthogonal users, and it has low complexity and fast convergence speed. Compared with other traditional method, the improved method has lower error rate under different signal-to-interference and noise ratio (SINR).

Hybrid DCT/DFflWavelet Architecture Based on Jacket Matrix

  • Chen, Zhu;Lee, Moon-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.281-282
    • /
    • 2007
  • We address a new representation of DCT/DFT/Wavelet matrices via one hybrid architecture. Based on an element inverse matrix factorization algorithm, we show that the OCT, OFT and Wavelet which based on Haar matrix have the similarrecursive computational pattern, all of them can be decomposed to one orthogonal character matrix and a special sparse matrix. The special sparse matrix belongs to Jacket matrix, whose inverse can be from element-wise inverse or block-wise inverse. Based on this trait, we can develop a hybrid architecture.

  • PDF

Vibration Design of a Rigid Body Supported by Orthogonal Springs (직교스프링들에 의해 지지되는 강체의 진동 설계)

  • Jang, Seon-Jun;Lee, Jun-Ho;Choi, Yong-Je
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.31 no.1 s.256
    • /
    • pp.97-104
    • /
    • 2007
  • Vibration analysis of a rigid body supported by in-parallel linear springs can be greatly simplified by utilizing the conditions for a plane of symmetry. The vibration modes of an oscillatory system having plane of symmetry are classified into the in-plane and out-of-plane modes. From the viewpoint of screw theory, they represent respectively the vibration axes perpendicular to the plane of symmetry and lying in the plane of symmetry. In this paper, the sets of orthogonal and mutually intersecting three springs are used as resilient support of a rigid body. The geometrical conditions for the system to have a plane of symmetry and diagonalized stiffness matrix are presented. From the orthogonality of the vibration modes with respect to the inertia matrix, the geometrical relation between the reaction wrenches and the vibration modes are derived. This geometrical relation is then used to get the cubic design equation for the design of out-of-plane modes. The numerical design example of engine mounts is presented in order to explain the suggested design technique.

Spectral encapsulation of OFDM systems based on orthogonalization for short packet transmission

  • Kim, Myungsup;Kwak, Do Young;Kim, Ki-Man;Kim, Wan-Jin
    • ETRI Journal
    • /
    • v.42 no.6
    • /
    • pp.859-871
    • /
    • 2020
  • A spectrally encapsulated (SE) orthogonal frequency-division multiplexing (OFDM) precoding scheme for wireless short packet transmission, which can suppress the out-of-band emission (OoBE) while maintaining the advantage of the cyclic prefix (CP)-OFDM, is proposed. The SE-OFDM symbol consists of a prefix, an inverse fast Fourier transform (IFFT) symbol, and a suffix generated by the head, center, and tail matrices, respectively. The prefix and suffix play the roles of a guard interval and suppress the OoBE, and the IFFT symbol has the same size as the discrete Fourier transform symbol in the CP-OFDM symbol and serves as an information field. Specifically, as the center matrix generating the IFFT symbol is orthogonal, data and pilot symbols can be allocated to any subcarrier without distinction. Even if the proposed precoder is required to generate OFDM symbols with spectral efficiency in the transmitter, a corresponding decoder is not required in the receiver. The proposed scheme is compared with CP-OFDM in terms of spectrum, OoBE, and bit-error rate.

Design of Experiment Using Design Matrix in Terms of Generalized Linear Model (일반화 선형모형의 디자인 행렬을 이용한 품질 실험 설계)

  • Choi, Sung-Woon
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2009.04a
    • /
    • pp.423-427
    • /
    • 2009
  • This study proposes the generation mechanism of various design matrix using generalized linear model for design of experiment. Design generation method of GLM analysis, factorial design(FD) with center points, ANOVA design with lack-of-fit test, and response surface design are introduced. In central composite(CC) design, orthogonal blocking and fractional factorial design(FFD) are presented. We compare the design of Box-Benhken(BB) and face-centred central compsite design.

  • PDF

비직교 기본 함수인 웨이티드 하다마드의 신호처리

  • 정종기;안성열;이문호
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1984.10a
    • /
    • pp.74-77
    • /
    • 1984
  • In this paper, We have proposed the new lee weighted Hadamard transform which retains the main properties of Hadamard matrix. The non-orthogonal LWH matrix was Weighted in the center of the spatial domain. The human visual response to spatioal requencies in nonuniform and that the mid spatial frequencies are emphasized more than the low and high spatial frequencies, the faast algorithm of the Lee Weighted Hadamard transform has shown by the sparse matrix factorization.

  • PDF

Joint Time Delay and Angle Estimation Using the Matrix Pencil Method Based on Information Reconstruction Vector

  • Li, Haiwen;Ren, Xiukun;Bai, Ting;Zhang, Long
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5860-5876
    • /
    • 2018
  • A single snapshot data can only provide limited amount of information so that the rank of covariance matrix is not full, which is not adopted to complete the parameter estimation directly using the traditional super-resolution method. Aiming at solving the problem, a joint time delay and angle estimation using matrix pencil method based on information reconstruction vector for orthogonal frequency division multiplexing (OFDM) signal is proposed. Firstly, according to the channel frequency response vector of each array element, the algorithm reconstructs the vector data with delay and angle parameter information from both frequency and space dimensions. Then the enhanced data matrix for the extended array element is constructed, and the parameter vector of time delay and angle is estimated by the two-dimensional matrix pencil (2D MP) algorithm. Finally, the joint estimation of two-dimensional parameters is accomplished by the parameter pairing. The algorithm does not need a pseudo-spectral peak search, and the location of the target can be determined only by a single receiver, which can reduce the overhead of the positioning system. The theoretical analysis and simulation results show that the estimation accuracy of the proposed method in a single snapshot and low signal-to-noise ratio environment is much higher than that of Root Multiple Signal Classification algorithm (Root-MUSIC), and this method also achieves the higher estimation performance and efficiency with lower complexity cost compared to the one-dimensional matrix pencil algorithm.