• Title/Summary/Keyword: orthogonal

Search Result 4,004, Processing Time 0.039 seconds

ON ORTHOGONAL REVERSE DERIVATIONS OF SEMIPRIME 𝚪-SEMIRINGS

  • Kim, Kyung Ho
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.35 no.2
    • /
    • pp.115-124
    • /
    • 2022
  • In this paper, we introduce the notion of orthogonal reserve derivation on semiprime 𝚪-semirings. Some characterizations of semiprime 𝚪-semirimgs are obtained by means of orthogonal reverse derivations. We also investigate conditions for two reverse derivations on semiprime 𝚪-semiring to be orthogonal.

Constant-Amplitude Multi-Code Trans-Orthogonal Modulation (정진폭 다중부호 트랜스직교변조)

  • Hong, Dae-Ki
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.1
    • /
    • pp.493-499
    • /
    • 2011
  • To improve the bandwidth efficiency of conventional orthogonal modulation, the MCTO(Multi-Code Trans-Orthogonal) modulation, which is modified orthogonal modulation, was proposed. However, the RF(Radio Frequency) power amplifier for the MCTO modulation is too complex to reject the amplitude distortion due to the non-constant amplitude property of the MCTO. Therefore, in this paper, CAMCTO(constant-amplitude multi-code trans-orthogonal) modulation is proposed by using the constant-amplitude encoding algorithm for multi-code signal. Additionally, the performance of the proposed CAMCTO modulation is compared with those of the orthogonal modulation and the MCTO modulation by using the computer simulation. The computer simulations show that the bandwidth efficiency of the proposed CAMCTO modulation is better than that of the conventional orthogonal modulation.

Flexural-Torsional Coupled Vibration of Slewing Beams Using Various Types of Orthogonal Polynomials

  • Kapania Rakesh K.;Kim, Yong-Yook
    • Journal of Mechanical Science and Technology
    • /
    • v.20 no.11
    • /
    • pp.1790-1800
    • /
    • 2006
  • Dynamic behavior of flexural-torsional coupled vibration of rotating beams using the Rayleigh-Ritz method with orthogonal polynomials as basis functions is studied. Performance of various orthogonal polynomials is compared to each other in terms of their efficiency and accuracy in determining the required natural frequencies. Orthogonal polynomials and functions studied in the present work are: Legendre, Chebyshev, integrated Legendre, modified Duncan polynomials, the special trigonometric functions used in conjunction with Hermite cubics, and beam characteristic orthogonal polynomials. A total of 5 cases of beam boundary conditions and rotation are studied for their natural frequencies. The obtained natural frequencies and mode shapes are compared to those available in various references and the results for coupled flexural-torsional vibrations are especially compared to both previously available references and with those obtained using NASTRAN finite element package. Among all the examined orthogonal functions, Legendre orthogonal polynomials are the most efficient in overall CPU time, mainly because of ease in performing the integration required for determining the stiffness and mass matrices.

Double Random Phase Encryption Based Orthogonal Encoding Technique for Color Images

  • Lee, In-Ho;Cho, Myungjin
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.2
    • /
    • pp.129-133
    • /
    • 2014
  • In this paper, we propose a simple Double random phase encryption (DRPE)-based orthogonal encoding technique for color image encryption. In the proposed orthogonal encoding technique, a color image is decomposed into red, green, and blue components before encryption, and the three components are independently encrypted with DRPE using the same key in order to decrease the complexity of encryption and decryption. Then, the encrypted data are encoded with a Hadamard matrix that has the orthogonal property. The purpose of the proposed orthogonal encoding technique is to improve the security of DRPE using the same key at the cost of a little complexity. The proposed orthogonal encoder consists of simple linear operations, so that it is easy to implement. We also provide the simulation results in order to show the effects of the proposed orthogonal encoding technique.

Measures for Evaluating the Orthogonal Array of Strength 3 (강도 3의 직교대열을 평가하기 위한 측도)

  • Jang Dae-Heung
    • The Korean Journal of Applied Statistics
    • /
    • v.18 no.3
    • /
    • pp.617-625
    • /
    • 2005
  • We usually use orthogonal designs-orthogonal array of strength 2 as orthogonal arrays. It was shown that fractional factorial plaits represented by orthogonal arrays of strength 3 are universally optimal under the additive motels that includes the mean, all main effects and all two-factor interactions. Therefore, we need the measure for evaluating the orthogonal array of strength 3. We can extend this measure as the measure for evaluating the orthogonal array of strength t($\ge$ 2).

Double Random Phase Encryption using Orthogonal Encoding for Multiple-Image Transmission

  • Lee, In-Ho;Cho, Myungjin
    • Journal of the Optical Society of Korea
    • /
    • v.18 no.3
    • /
    • pp.201-206
    • /
    • 2014
  • In this paper we extend double random phase encryption (DRPE) using orthogonal encoding from single-image transmission to multiple-image transmission. The orthogonal encoding for multiple images employs a larger Hadamard matrix than that for a single image, which can improve security. We provide a scheme for DRPE with an orthogonal codec, and a method for orthogonal encoding/decoding for multiple-image transmission. Finally, simulation results verify that the DRPE using orthogonal encoding for multiple images is more secure than both the conventional DRPE and the DRPE using orthogonal encoding for a single image.

APPLICATION AND FIXED POINT THEOREMS FOR ORTHOGONAL GENERALIZED F-CONTRACTION MAPPINGS ON O-COMPLETE METRIC SPACE

  • Mani, Gunaseelan;Prakasam, A. Leema Maria;Mishra, Lakshmi Narayan;Mishra, Vishnu Narayan
    • Nonlinear Functional Analysis and Applications
    • /
    • v.26 no.5
    • /
    • pp.903-915
    • /
    • 2021
  • In this paper, we introduce the concepts of an orthogonal generalized F-contraction mapping and prove some fixed point theorems for a self mapping in an orthogonal metric space. The given results are generalization and extension some of the well-known results in the literature. An example to support our result is presented.

Quasi-Orthogonal STBC with Iterative Decoding in Bit Interleaved Coded Modulation

  • Sung, Chang-Kyung;Kim, Ji-Hoon;Lee, In-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.4A
    • /
    • pp.426-433
    • /
    • 2008
  • In this paper, we present a method to improve the performance of the four transmit antenna quasi-orthogonal space-time block code (STBC) in the coded system. For the four transmit antenna case, the quasi-orthogonal STBC consists of two symbol groups which are orthogonal to each other, but intra group symbols are not. In uncoded system with the matched filter detection, constellation rotation can improve the performance. However, in coded systems, its gain is absorbed by the coding gain especially for lower rate code. We propose an iterative decoding method to improve the performance of quasi-orthogonal codes in coded systems. With conventional quasi-orthogonal STBC detection, the joint ML detection can be improved by iterative processing between the demapper and the decoder. Simulation results shows that the performance improvement is about 2dB at 1% frame error rate.

Collision Dispersion Based on Orthogonal Pre-Spreading in Orthogonal Code Hopping Multiplexing (OCHM 시스템에서 전확산에 의한 충돌 분산 기법)

  • Kwon, Jae-Kyun;Jung, Bang-Chul;Yun, Kyung-Su;Sung, Dan-Keun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.9A
    • /
    • pp.679-684
    • /
    • 2009
  • A collision dispersion scheme based on orthogonal pre-spreading is proposed to reduce the effect of collisions that occur in orthogonal code hopping multiplexing(OCHM). The OCHM scheme was previously proposed to accommodate a significantly larger number of low-activity bursty channels than the number of orthogonal codewords. The proposed scheme greatly reduces the required SNR in channel decoding. In addition, the proposed scheme can be applied to OFHM based on OFDM.