• Title/Summary/Keyword: 셀룰라

Search Result 421, Processing Time 0.024 seconds

A Study on the Small Isolator Characteristics and Design of Mobile Phones (이동통신 단말기용 소형 아이솔레이터 특성 및 설계에 관한 연구)

  • 이영훈;권원현
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.12 no.2
    • /
    • pp.165-175
    • /
    • 2001
  • In this paper, it is analyzed lumped element isolators analytically by the analysis program using scattering matrixes including ferrite saturation magnetization, external direct current magnetic field and strip line length and width, designed and experimented the small isolator of mobile phone. The simulation results show that the characteristics of the isolator are affected by external R, C, length and width of strip line and ferrite width and saturation magnetization sensitivity. We proposed the isolator specification applied cellular and PCS mobile phones, experimented the isolator for cellular mobile phones. From the experimented result, isolation and return loss are measured below 20 dB, insertion loss is below 0.7 dB, bandwidth is about 44 MHz at center frequency 836.5 KHz. The implemented isolator has better performances than the conventional one.

  • PDF

Wide Range loT Technology and Standardization based on LPWA (LPWA기반 광역 IoT기술 및 표준화)

  • Kim, S.Y.;Park, S.K.;Choi, H.D.
    • Electronics and Telecommunications Trends
    • /
    • v.31 no.2
    • /
    • pp.95-106
    • /
    • 2016
  • 사물인터넷(Internet of Things: IoT)이란 모든 사물이 인터넷에 연결되어 상호 간에 직접 통신하는, 향후 정보통신의 미래 인프라 및 서비스이다. 이것이 필요한 이유는 초연결 사회에 기반을 둔 삶의 질 향상과 생산성 향상에 있으며, 최종적으로는 국가 자체의 인프라, 더 나아가서는 인류를 위한 중추 신경계를 이루기 때문에 무엇보다 중요하다. IoT는 셀룰러 이동통신 기반의 IoT와 비셀룰러기반의 IoT로 대분되어 오다가 두 분야의 융합이 이루어지고 있다. 그러나 IoT는 현재 거품 최고조기에 있으며, 아직까지 주목할 만한 큰 수익모델이 없는 상태이다. 그 이유는 사물인터넷 서비스 활성화에 가장 걸림돌이 되어온 보안문제, 배터리수명, 통신거리, IoT 디바이스를 포함한 솔루션 가격 그리고 월정료 문제가 여전히 존재하기 때문이다. 최근 이들 문제 해결을 목적으로, 대량의 IoT 디바이스를 필요로 하는 새로운 사물인터넷 커넥티비티에 대한 재정의, 표준화 및 솔루션 개발이 핫이슈이다. 본고에서는 셀룰라 및 비셀룰라 IoT기반의 Low Power Wide Area(LPWA), 즉 저전력 광역 IoT에 대한 시장, 기술 및 솔루션 비교 그리고 표준화 동향을 다룬다. 또한, 비셀룰라기반 즉 비면허대역과 프리밴드 활용을 통한 기술적 및 정책적 대응전략을 살펴본다.

  • PDF

Modular Multiplier based on Cellular Automata Over $GF(2^m)$ (셀룰라 오토마타를 이용한 $GF(2^m)$ 상의 곱셈기)

  • 이형목;김현성;전준철;유기영
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.1_2
    • /
    • pp.112-117
    • /
    • 2004
  • In this paper, we propose a suitable multiplication architecture for cellular automata in a finite field $GF(2^m)$. Proposed least significant bit first multiplier is based on irreducible all one Polynomial, and has a latency of (m+1) and a critical path of $ 1-D_{AND}+1-D{XOR}$.Specially it is efficient for implementing VLSI architecture and has potential for use as a basic architecture for division, exponentiation and inverses since it is a parallel structure with regularity and modularity. Moreover our architecture can be used as a basic architecture for well-known public-key information service in $GF(2^m)$ such as Diffie-Hellman key exchange protocol, Digital Signature Algorithm and ElGamal cryptosystem.

Reverse Link Interference Bounds in CDMA Cellular Systems (CDMA 셀룰라 시스템에서의 역방향 간섭 한계)

  • 김호준
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.7 no.3
    • /
    • pp.395-402
    • /
    • 2003
  • The capacity of a CDMA cellular system is determined by the amount of interference, therefore the exact estimation of interference is important to evaluate the system performance. In this paper, we propose an approximated equation which calculates reverse link other cell interference in the CDMA cellular systems. The equation using Riemann-Zeta function has a property that it is useful in case of any radio propagation loss exponents. And we compare calculation results with simulation results in other to verify it's usefulness. The upper bound of system capacity calculated with the proposed approximated equation gives almost alike result with the simulation. The proposed interference bound is useful to calculate system capacity and to evaluate some algorithm in a hierarchical cellular system which must be considered various propagation exponents.

A Channel Assignment by Graph Coloring Problem in Cellular Mobile Communication Control System (셀룰라 이동통신 제어 시스템에서 색채화 문제에 의한 채널할당)

  • 장성환;라상동
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.9
    • /
    • pp.1658-1667
    • /
    • 1994
  • In a cellular mobile communication control system, assignment channel for a call in a cell so as to achieve high spectral efficience is an important problem within limited frequence bandwidth. The spectral efficiency is related to the coloring problem of graph theory in a cellular mobile communication control system. In this paper, we propose channel offset scheme using a graph theory of cellular mobile communication control system and formulate chromatic bandwidth of channel offset system which is related graph coloring problem. From formulated channel assignment problem, we investgate an optimal channel offset scheme of more efficent frequence spectrum and cell design according to channel constitution and give and upper and lower bound for overall srectral bandwidth.

  • PDF

Characterization of SACA over GF(2$^{p}$) (GF(2$^{p}$) 위에서의 SACA의 특성화)

  • Choi, Un-Sook;Cho, Sung-Jin;Hwang, Yoon-Hee
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.335-338
    • /
    • 2005
  • Though GF(2) CA can only handle data with bit units, GF(2$^{p}$) CA can handle data with byte units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2$^{p}$). And we propose the constructing method of the state-transition diagram of a linear SACA over GF(2$^{p}$) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.

  • PDF

Image Encryption using Cellular Automata Sequence with Two Maximum Cycle (두 개의 최대 주기를 갖는 셀룰라 오토마타 수열을 이용한 영상 암호화)

  • Nam, Tae-Hee;Cho, Sung-Jin;Kim, Seok-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.5
    • /
    • pp.1201-1208
    • /
    • 2010
  • In this paper, we propose an image encryption method using two linear MLCA(Maximum Length Cellular Automata). The encryption method first sets arbitrary 8 bit initial values. Next, we create high quality PN(pseudo noise) sequences by converting rows and columns with the set initial values. hen we generate a basis image using the set PN sequences. Lastly, the final image with high encryption level is produced by XOR operation of the basis image and the original image. In order to verify that the proposed method has the high encryption level, we performed histogram and stability analysis.

The Design and Implementation of Interference Canceller Systems in the Environments with Co-existing ETACS and CDMA Digital Cellular Systems (ETACS와 CDMA 디지털 셀룰라 시스템이 공존하는 환경에서 Interference Canceller System의 설계 및 구현)

  • Jang, Won-Ho;Hong, Ju-Seok;Lee, Yun-Hyun
    • Journal of Advanced Navigation Technology
    • /
    • v.6 no.4
    • /
    • pp.273-278
    • /
    • 2002
  • In this paper, we provide the Interference Canceller Systems(ICS) in the wireless environments in the presence of co-existing ETACS and CDMA digital cellular systems to effectively cancel the interference than the established canceller systems. We proved the enhanced cancelling performances more than 29 dB cancellation characteristics between co-existing ETACS and CDMA digital cellular systems and the stabilized system characteristics in the rapidly changing wireless circumstances.

  • PDF

Generation of Maximum Length Cellular Automata (최대길이를 갖는 셀룰라 오토마타의 생성)

  • Choi Un-Sook;Cho Sung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.25-30
    • /
    • 2004
  • Linear cellular automata(CA) which generate maximum-length cycles, have wide applications in generation of pseudo-random patterns, signature analysis, cryptography and error correcting codes etc. Linear CA whose characteristic polynomial is primitive has been studied. In this paper Ive propose a effective method for generation of a variety of maximum-length CA(MLCA). And we show that the complemented CA's derived from a linear MLCA are all MLCA. Also we analyze the Properties of complemented MLCA. And we prove that the number of n-cell MLCA is ${\phi}(2^{n}-1)2^{n+1}$/n.

The Analysis of State-Transition of SACA over GF(2p) (GF(2p) 위에서의 SACA의 상태전이 분석)

  • Cho Sung-Jin;Hwang Yoon-Hee;Kim Han-Doo;Pyo Yong-Soo;Choi Un-Sook
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.15 no.2
    • /
    • pp.105-111
    • /
    • 2005
  • Though GF(2) CA can only handle data with bit units GF(2p) CA can handle data with units more than bit units. In this paper we analyze the state-transition of nongroup cellular automata(CA) with a single attractor over GF(2p). And we propose the constructing method the state-transition diagram of a linear SACA over GF(2p) by using the concept of basic path. Also we propose the state-transition diagram of the nonlinear complemented SACA by using the state-transition diagram of a linear SACA.