• Title/Summary/Keyword: Hadamard Matrix

Search Result 86, Processing Time 0.022 seconds

Controlling the Intensity Distribution of Light at the Output of a Multimode Optical Fiber Using a Polar-coordinate-based Transmission-matrix Method (극좌표 기반 투과 매트릭스 방법을 이용한 다중모드 광섬유 출력단에서의 빛의 세기 분포 제어)

  • Park, Jaedeok;Jo, Jaepil;Yoon, Jonghee;Yeom, Dong-Il
    • Korean Journal of Optics and Photonics
    • /
    • v.33 no.6
    • /
    • pp.252-259
    • /
    • 2022
  • We have conducted a study to control the light-intensity distribution at the output end of a multimode optical fiber via estimating the transmission matrix. A circularly arranged Hadamard eigenmode phase distribution was implemented using a spatial light modulator, and the transmission matrix of a multimode optical fiber was experimentally obtained using a four-phase method. Based on the derived transmission matrix, the spatial phase distribution of light incident upon the optical fiber was adjusted via the spatial light modulator in advance, to focus the light at a desired position at the optical fiber output. The light could be focused with an intensity up to 359.6 times as high as that of the surrounding background signal at a specific position of the multimode fiber's output end, and the intensity of the focused beam was on average 104.6 times as large as that of the background signal, across the area of the multimode fiber's core.

Why Won't the Field Wall Collapse in the Typhoon? : Mathematical Approach to Non-orthogonal Symmetric Weighted Hadamard Matrix I (밭담은 태풍에 왜 안 무너지나?: 비직교 대칭 하중 아다마르 행렬에 의한 수학적 접근 I)

  • Lee, Moon-Ho;Kim, Jeong-Su
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.211-217
    • /
    • 2019
  • The three major inventions of Jeju include the field wall of Kim Koo Pan Gwan in 1234, Jeongnang in the custom of grazing the people of Jeju, and Olleh in the tomb of Munbang-gui in 1406. Field wall, Oedam from the stone and the stone of numerical play, made Koendang, a friendship society. Even with a typhoon that is more than 30m/s, the Koendang which is about 1.5m high, will not collapse. Similarly, the main family networks of Jeju society do not collapse under any difficulties situation. When building a field wall, two stones, which are under the ground, are placed side by side, and the upper left stone is placed on top and the upper right stone is attached regularly. One stone or two stone is attached from the bottom to the top, and when a stone is small or large, a flat field is formed in one space. The Family networks is close to the grandfather, grandmother, father, mother, and me, and the distant kin represents a horizontal relationship. The field wall is a vertical relationship that builds up from bottom to top of the vertical relation, while the Koendang is a horizontal relationship where blood is distributed to the grandson of his upper grandparents. This paper proves by a non-orthogonal symmetric weighted Hadamard matrix of whether the stone in the middle of a field wall has large stones (small).

A NOTE ON CONVERTIBLE {0,1} MATRICES

  • Kim, Si-Ju;Park, Taeg-Young
    • Communications of the Korean Mathematical Society
    • /
    • v.12 no.4
    • /
    • pp.841-849
    • /
    • 1997
  • A square matrix A with $per A \neq 0$ is called convertible if there exists a {1, -1} matrix H such that $per A = det(H \circ A)$ where $H \circ A$ denote the Hadamard product of H and A. In this paper, ranks of convertible {0, 1} matrices are investigated and the existence of maximal convertible matrices with its rank r for each integer r with $\left\lceil \frac{n}{2} \right\rceil \leq r \leq n$ is proved.

  • PDF

Transmission Matrix Noise Elimination for an Optical Disordered Medium

  • Wang, Lin;Li, Yangyan;Xin, Yu;Wang, Jue;Chen, Yanru
    • Current Optics and Photonics
    • /
    • v.3 no.6
    • /
    • pp.496-501
    • /
    • 2019
  • We propose a method to eliminate the noise of a disordered medium optical transmission matrix. Gaussian noise exists whenever light passes through the medium, during the measurement of the transmission matrix and thus cannot be ignored. Experiments and comparison of noise eliminating before and after are performed to illustrate the effectiveness and advance presented by our method. After noise elimination, the results of focusing and imaging are better than the effect before noise elimination, and the measurement of the transmission matrix is more consistent with the theoretical analysis as well.

Improvement of Image Scrambling Scheme Using DPSS(Discrete Prolate Spheroidal Sequence) and Digital Watermarking Application (DPSS(Discrete Prolate Spheroidal Sequence)를 이용한 영상 스크램블링 방식의 개선 및 디지털 워터마킹 응용)

  • Lee, Hye-Joo;Nam, Je-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1417-1426
    • /
    • 2007
  • As one of schemes to protect multimedia content. it is the selective encryption scheme to encrypt partially multimedia content. Compared AES(advanced encryption standard) of traditional encryption, the selective encryption scheme provides low security but is applicable to applications of multimedia content not to require high secrecy. In this paper, we improve the image scrambling scheme proposed by Van De Ville which scrambles an image without bandwidth expansion using DPSS(discrete prolate spheroidal sequence) to make it more secure based on Shujun's research which verifies the secrecy of Van De Ville's scheme. The proposed method utilizes an orthonormalized random matrix instead of Hadamard matrix for secret matrix and to add it for providing high secrecy against statistical attack or known-plaintext attack using some statistical property or estimate of secret matrix from a scrambled image. The experimental results show that the proposed method is more secure than the existing scheme. In addition, we show that the proposed method can be applied to access control or copy control of watermarking application.

  • PDF

Integer Inverse Transform Structure Based on Matrix for VP9 Decoder (VP9 디코더에 대한 행렬 기반의 정수형 역변환 구조)

  • Lee, Tea-Hee;Hwang, Tae-Ho;Kim, Byung-Soo;Kim, Dong-Sun
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.53 no.4
    • /
    • pp.106-114
    • /
    • 2016
  • In this paper, we propose an efficient integer inverse transform structure for vp9 decoder. The proposed structure is a hardware structure which is easy to control and requires less hardware resources, and shares algorithms for realizing entire DCT(Discrete Cosine Transform), ADST(Asymmetric Discrete Sine Transform) and WHT(Walsh-Hadamard Transform) in vp9. The integer inverse transform for vp9 google model has a fast structure, named butterfly structure. The integer inverse transform for google C model, unlike universal fast structure, takes a constant rounding shift operator on each stage and includes an asymmetrical sine transform structure. Thus, the proposed structure approximates matrix coefficient values for all transform mode and is used to matrix operation method. With the proposed structure, shared operations for all inverse transform algorithm modes can be possible with reduced number of multipliers compared to the butterfly structure, which in turn manages the hardware resources more efficiently.

A Study on Transform Coding of Image Signal using Microcomputer (마이크로컴퓨터를 이용한 영상신호의 변환부호화에 관한 연구)

  • 황재정;김종교;이문호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.3
    • /
    • pp.197-203
    • /
    • 1986
  • The images which are scanned by CCTV are converted to digital signal and 6502 Microcomputer processes data by Transform coding. Thus data is reduced to $64{ imes}64$pixels and input by outer memory using same address with inner one for the fast process. Hadmard Transform, Weighted Hadamard Transform which is weighted in the center of matrix and Haar Transform are programmed by assembly language and every Transform is dome within one second.

  • PDF

ALGORITHMS FOR GENERATING NONLINEAR COMBINERS WITH GIVEN CONDITIONS

  • Rhee, Min-Surp;Shin, Hyun-Yong;Jun, Youn-Bae
    • Journal of applied mathematics & informatics
    • /
    • v.7 no.1
    • /
    • pp.269-278
    • /
    • 2000
  • A Boolean function generates a binary sequence which is frequently used in a stream cipher. There are number of critical concepts which a Boolean function, as a key stream generator in a stream cipher, satisfies. These are nonlinearity, correlation immunity, balancedness, SAC(strictly avalanche criterion), PC(propagation criterion) and so on. In this paper, we present the algorithms for generating random nonlinear combining functions satisfying given correlation immune order and nonlinearity. These constructions can be applied for designing the key stream generators. We use Microsoft Visual C++6.0 for our program.

A New Sparse Matrix Analysis of DFT Similar to Element Inverse Jacket Transform (엘레멘트 인버스 재킷 변환과 유사한 DFT의 새로운 희소 행렬 분해)

  • Lee, Kwang-Jae;Park, Dae-Chul;Lee, Moon-Ho;Choi, Seung-Je
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.4C
    • /
    • pp.440-446
    • /
    • 2007
  • This paper addresses a new representation of DFT matrix via the Jacket transform based on the element inverse processing. We simply represent the inverse of the DFT matrix following on the factorization way of the Jacket transform, and the results show that the inverse of DFT matrix is only simply related to its sparse matrix and the permutations. The decomposed DFT matrix via Jacket matrix has a strong geometric structure that exhibits a block modulating property. This means that the DFT matrix decomposed via the Jacket matrix can be interpreted as a block modulating process.

Semi-deterministic Sparse Matrix for Low Complexity Compressive Sampling

  • Quan, Lei;Xiao, Song;Xue, Xiao;Lu, Cunbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.5
    • /
    • pp.2468-2483
    • /
    • 2017
  • The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.