• Title/Summary/Keyword: Approach Channel

Search Result 963, Processing Time 0.025 seconds

Increase in Voltage Efficiency of Picoinjection using Microfluidic Picoinjector Combined Faraday Moat with Silver Nanoparticles Electrode (은 나노입자 전극과 패러데이 모트를 이용한 미세유체 피코리터 주입기의 전압효율 상승)

  • Noh, Young Moo;Jin, Si Hyung;Jeong, Seong-Geun;Kim, Nam Young;Rho, Changhyun;Lee, Chang-Soo
    • Korean Chemical Engineering Research
    • /
    • v.53 no.4
    • /
    • pp.472-477
    • /
    • 2015
  • This study presents modified microfluidic picoinjector combined Faraday moat with silver nanoparticle electrode to increase electrical efficiency and fabrication yield. We perform simple dropping procedure of silver nanoparticles near the picoinjection channel, which solve complicate fabrication process of electrode deposition onto the microfluidic picoinjector. Based on this approach, the microfluidic picoinjector can be reliably operated at 180 V while conventional Faraday moat usually have performed above 260 V. Thus, we can reduce the operation voltage and increase safety. Furthermore, the microfluidic picoinjector is able to precisely control injection volume from 7.5 pL to 27.5 pL. We believe that the microfluidic picoinjector will be useful platform for microchemical reaction, biological assay, drug screening, cell culture device, and toxicology.

A Customer Segmentation Scheme Base on Big Data in a Bank (빅데이터를 활용한 은행권 고객 세분화 기법 연구)

  • Chang, Min-Suk;Kim, Hyoung Joong
    • Journal of Digital Contents Society
    • /
    • v.19 no.1
    • /
    • pp.85-91
    • /
    • 2018
  • Most banks use only demographic information such as gender, age, occupation and address to segment customers, but they do not reflect financial behavior patterns of customers. In this study, we aim to solve the problems by using various big data in a bank and to develop customer segmentation method which can be widely used in many banks in the future. In this paper, we propose an approach of segmenting clustering blocks with bottom-up method. This method has an advantage that it can accurately reflect various financial needs of customers based on various transaction patterns, channel contact patterns, and existing demographic information. Based on this, we will develop various marketing models such as product recommendation, financial need rating calculation, and customer churn-out prediction based on this, and we will adapt this models for the marketing strategy of NH Bank.

Implementation of a FLEX Protocol Signal Processor for High Speed Paging System (고속 페이징 시스템을 위한 FLEX 프로토콜 신호처리기의 구현)

  • Gang, Min-Seop;Lee, Tae-Eung
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.1
    • /
    • pp.69-78
    • /
    • 2001
  • This paper presents the design and FPGA implementation of a FLEX PSP(Protocol Signal Processor) for the portable high speed paging system. In this approach, two algorithms are newly proposed for implementing the PSP which provides capabilities of the maximum 6,400bps at speed, high-channel throughput, real time error correction and an effective frame search function. One is an accurate symbol synchronization algorithm which is applied for synchronizing the interleaved 4-level bit symbols which are received at input stage of A/D converter, and the other is a modified fast decoding algorithm which is provided for realizing double error correction of (31,21)BCH signal. The PSP is composed of six functional modules, and each module is modelled in VHDL(VHSIC Hardware Description Language). Both functional simulation and logic synthesis have performed for the proposed PSP through the use of Synopsys$^{TM}$ tools on a Axil-320 Workstation, and where Altera 10K libraries are used for logic synthesis. From logic synthesis, we can see that the number of gates is about 2,631. For FPGA implementation, timing simulation is performed by using Altera MAX+ PLUS II, and its results will be also given. The PSP which is implemented in 6 FPGA devices on a PCB has been verified by means of Logic Analyzer.r.

  • PDF

Semi-Analytical Averaged Error Rate Evaluation for DSF-Relay MC-CDMA systems over Multipath Rayleigh Fading Channels (다중경로 레일리 페이딩 채널에 대한 DSF 릴레이 MC-CDMA 시스템의 평균 오류율 의사 분석 기법)

  • Ko, Kyun-Byoung
    • Journal of IKEEE
    • /
    • v.16 no.2
    • /
    • pp.138-144
    • /
    • 2012
  • In this paper, a semi-analytical approach is proposed for DSF(Decode and Selective Forward)-Relay MC-CDMA(MultiCarrier-Code Division Multiple Access) systems over multipath Rayleigh fading channels. Considering BER(bit error rate) performance and complexity, the MMSE-C(Minimum Mean squared Error-per subCarrier) is used as the combining method for MC-CDMA systems. At first, the analytical method based on error-events at relay nodes for DSF-Relay schemes is utilized in order to derive the averaged BER. Then, the averaged BER is expressed as the form considering possible all error-events. Also, proposed semi-analytical expressions have been verified by comparing with simulation results. Finally, it is verified that the derived analytical expressions can be a frame work to cover different multipath Rayleigh fading channel conditions and to measure the upper performance for DSF-Relay MC-CDMA systems.

A Cross-Layer Cooperative Routing Architecture for Mobile Wireless Sensor Networks (모바일 무선 센서 네트워크를 위한 Cross-Layer 협력도움 라우팅 구조)

  • Lee, Joo-Sang;An, Beong-Ku
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.1
    • /
    • pp.141-150
    • /
    • 2011
  • In this paper, we propose a Cross-Layer Cooperative Routing(CLCR) architecture to support transmission efficiency in mobile wireless sensor networks. The main features and contributions of the proposed architecture and method are as follows. First, the clustering which uses the location information of nodes is utilized as infrastructure. Second, a cross-layer strategy which uses the technologies of network layer, MAC layer, physical layer together to support transmission efficiency and channel efficiency for cooperative-aided routing and transmission. Third, we consider realistic approach in the view points of the mobile ad-hoc wireless sensor networks while conventional methods just consider fixed sensor network environments. The performance evaluation of the proposed method is performed via simulation using OPNET and theoretical analysis. The results of performance evaluation of the proposed CLCR show improvement of transmission efficiency by the proposed CLCR.

Quantification of 3D Pore Structure in Glass Bead Using Micro X-ray CT (Micro X-ray CT를 이용한 글라스 비드의 3차원 간극 구조 정량화)

  • Jung, Yeon-Jong;Yun, Tae-Sup
    • Journal of the Korean Geotechnical Society
    • /
    • v.27 no.11
    • /
    • pp.83-92
    • /
    • 2011
  • The random and heterogeneous pore structure is a significant factor that dominates physical and mechanical behaviors of soils such as fluid flow and geomechanical responses driven by loading. The characterization method using non-destructive testing such as micro X-ray CT technique which has a high resolution with micrometer unit allows to observe internal structure of soils. However, the application has been limited to qualitatively observe 2D and 3D CT images and to obtain the void ratio at macro-scale although the CT images contain enormous information of materials of interests. In this study, we constructed the 3D particle and pore structures based on sequentially taken 2D images of glass beads and quantitatively defined complex pore structure with void cell and void channel. This approach was enabled by implementing image processing techniques that include coordinate transformation, binarization, Delaunay Triangulation, and Euclidean Distance Transform. It was confirmed that the suggested algorithm allows to quantitatively evaluate the distribution of void cells and their connectivity of heterogeneous pore structures for glass beads.

A Low Complicate Reverse Rake Beamforming Algorithm Based On Simplex Downhill Optimization Method For DS/CDMA Communication (Simplex Downhill 최적화 기법을 기반으로 하는 간략화 된 DS/CDMA 역방향 링크 Rake Beamforming Method)

  • Lee Sang-Keun;Lee Yoon-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3A
    • /
    • pp.249-253
    • /
    • 2006
  • We propose a new beamforming algorithm, which is based on simplex downhill optimization method in the presence of pilot channels in cdma2000 reverse-link, for the rake structure antenna array in DS/CDMA communication system. Our approach uses the desired signal(pilot) covariance matrix and the interference covariance matrix. The beamforming weights are made according to maximum SINR criteria using simplex downhill optimization procedure. Our proposed scheme provides lower computational load, better convergence speed, better performance than existingadaptive beamforming algorithm. The simplex downhill method is well suited to finding the optimal or sub-optimal weight vector, since they require only the value of the deterministic function to be optimized. The rake beamformer performances are also evaluated under several set of practical parameter values with regard to spatial channel model. We also compare the performance between conventional rake receiver and the proposed one under same receiving power.

Substream-based out-of-sequence packet scheduling for streaming stored media (저장매체 스트리밍에서 substream에 기초한 비순차 패킷 스케줄링)

  • Choi Su Jeong;Ahn Hee June;Kang Sang Hyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.10C
    • /
    • pp.1469-1483
    • /
    • 2004
  • We propose a packet scheduling algorithms for streaming media. We assume that the receiver periodically reports back the channel throughput. From the original video data, the importance level of a video packet is determined by its relative position within its group of pictures, taking into account the motion-texture discrimination and temporal scalability. Thus, we generate a number of nested substreams. Using feedback information from the receiver and statistical characteristics of the video, we model the streaming system as a queueing system, compute the run-time decoding failure probability of a Same in each substream based on effective bandwidth approach, and determine the optimum substream to be sent at that moment in time. Since the optimum substream is updated periodically, the resulting sending order is different from the original playback order. From experiments with real video data, we show that our proposed scheduling scheme outperforms the conventional sequential sending scheme.

Tight Bounds and Invertible Average Error Probability Expressions over Composite Fading Channels

  • Wang, Qian;Lin, Hai;Kam, Pooi-Yuen
    • Journal of Communications and Networks
    • /
    • v.18 no.2
    • /
    • pp.182-189
    • /
    • 2016
  • The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

Modified Block Diagonalization Precoding with Greedy Approach (Greedy 기법을 이용한 수정된 블록 대각화 프리코딩 기법)

  • Kim, Sung-Tae;Seo, Woo-Hyun;Kwak, Kyung-Chul;Hong, Dae-Sik
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.79-85
    • /
    • 2008
  • Dirty Paper Coding(DPC) can achieve the sum capacity of a multiuser multiple-input multiple-output(MU MIMO) broadcast channels. However, due to the high computational complexity of the successive encoding and decoding, deploying DPC in real systems is impractical. As one of practical alternatives to DPC, Block Diagonalization(BD) was researched. BD is an extension of the zero-forcing preceding technique that eliminates interuser interference(IUI) in downlink MIMO systems. Though BD has lower complexity than DPC, BD shows poor sum capacity performance. We show that sum capacity performance of BD is degraded due to no IUI constraint. Then, we modify BD to improve its sum capacity performance with relaxing the constraint and sub optimal channel set searching. With simulation results, it can be verified that our modification in BD induces some improvement in sum capacity performance.