• Title/Summary/Keyword: Random Channel

Search Result 507, Processing Time 0.026 seconds

Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels

  • Yu, Kai;Sun, Yi;Fan, Pingzhi;Lei, Xianfu;Shu, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.4 no.4
    • /
    • pp.509-528
    • /
    • 2010
  • The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigated, under the assumption of infinite number of users and infinite spreading gain with their ratio converging to a constant. The low bound of the signal to interference and noise ratio (SINR) is shown to converge almost surely to a constant. The throughput, spectrum efficiency and energy efficiency in the dominating systems are obtained. The analytical results are confirmed by simulations. We find that in high traffic loads the throughput with fading is higher than that without. When the energy efficiency increases, the spectrum efficiency tends to two contrary values due to SNR increases or decreases. For the ordinary stable systems, the stability region is shown to shrink as the traffic increases and enlarge with RD employment.

Partly Random Multiple Weighting Matrices Selection for Orthogonal Random Beamforming

  • Tan, Li;Li, Zhongcai;Xu, Chao;Wang, Desheng
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.892-901
    • /
    • 2016
  • In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.

Contextual Modeling and Generation of Texture Observed in Single and Multi-channel Images

  • Jung, Myung-Hee
    • Korean Journal of Remote Sensing
    • /
    • v.17 no.4
    • /
    • pp.335-344
    • /
    • 2001
  • Texture is extensively studied in a variety of image processing applications such as image segmentation and classification because it is an important property to perceive regions and surfaces. This paper focused on the analysis and synthesis of textured single and multiband images using Markov Random Field model considering the existent spatial correlation. Especially, for multiband images, the cross-channel correlation existing between bands as well as the spatial correlation within band should be considered in the model. Although a local interaction is assumed between the specified neighboring pixels in MRF models, during the maximization process, short-term correlations among neighboring pixels develop into long-term correlations. This result in exhibiting phase transition. In this research, the role of temperature to obtain the most probable state during the sampling procedure in discrete Markov Random Fields and the stopping rule were also studied.

Scaling Down Characteristics of Vertical Channel Phase Change Random Access Memory (VPCRAM)

  • Park, Chun Woong;Park, Chongdae;Choi, Woo Young;Seo, Dongsun;Jeong, Cherlhyun;Cho, Il Hwan
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.14 no.1
    • /
    • pp.48-52
    • /
    • 2014
  • In this paper, scaling down characteristics of vertical channel phase random access memory are investigated with device simulator and finite element analysis simulator. Electrical properties of select transistor are obtained by device simulator and those of phase change material are obtained by finite element analysis simulator. From the fusion of both data, scaling properties of vertical channel phase change random access memory (VPCRAM) are considered with ITRS roadmap. Simulation of set reset current are carried out to analyze the feasibility of scaling down and compared with values in ITRS roadmap. Simulation results show that width and length ratio of the phase change material (PCM) is key parameter of scaling down in VPCRAM. Thermal simulation results provide the design guideline of VPCRAM. Optimization of phase change material in VPCRAM can be achieved by oxide sidewall process optimization.

Exact Error Rate of Dual-Channel Receiver with Remote Antenna Unit Selection in Multicell Networks

  • Wang, Qing;Liu, Ju;Zheng, Lina;Xiong, Hailiang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3585-3601
    • /
    • 2016
  • The error rate performance of circularly distributed antenna system is studied over Nakagami-m fading channels, where a dual-channel receiver is employed for the quadrature phase shift keying signals detection. To mitigate the Co-Channel Interference (CCI) caused by the adjacent cells and to save the transmit power, this work presents remote antenna unit selection transmission based on the best channel quality and the maximized path-loss, respectively. The commonly used Gaussian and Q-function approximation method in which the CCI and the noise are assumed to be Gaussian distributed fails to depict the precise system performance according to the central limit theory. To this end, this work treats the CCI as a random variable with random variance. Since the in-phase and the quadrature components of the CCI are correlated over Nakagami-m fading channels, the dependency between the in-phase and the quadrature components is also considered for the error rate analysis. For the special case of Rayleigh fading in which the dependency between the in-phase and the quadrature components can be ignored, the closed-form error rate expressions are derived. Numerical results validate the accuracy of the theoretical analysis, and a comparison among different transmission schemes is also performed.

Dynamic Channel Assignment Scheme Based on the Number of Success and Collision of Random Channel in HIPERLAN/2 (HIPERLAN/2에서 랜덤채널의 성공수와 충돌수에 기반한 동적 채널할당 방안)

  • Lim, Seog-Ku
    • Journal of Digital Contents Society
    • /
    • v.12 no.3
    • /
    • pp.347-353
    • /
    • 2011
  • In HIPERLAN/2, the radio channels are assigned by AP(Access Point) that is centrally operated and the MAC protocol is based on TDMA/TDD. Mobile terminal that data transmission is necessary to uplink requests radio resource to AP through RCH channel. The changing number of RCHs in each MAC frame is important because too many RCHs may result in a waste of radio resources and too few RCHs may result in many access collisions and prolong time that connect to AP. Hence the number of RCH should be allocated properly according to traffic. From these point, this paper proposes an scheme that dynamically assigned the number of RCH which is based on the number of success and collision of message in previous MAC frame. To prove efficiency of proposed scheme, lots of simulations are conducted and analyzed.

Adaptive Control Technique for the Random Access Channel in DVB-RCS2 based Next Generation Military Satellite Networks (DVB-RCS2 기반 차세대 군 위성 네트워크 랜덤 액세스 채널 적응형 제어 기법)

  • Lee, WonKyun;Jang, Dae-Hee;Chung, Jong-Moon
    • Journal of Internet Computing and Services
    • /
    • v.21 no.2
    • /
    • pp.99-108
    • /
    • 2020
  • In this paper, we analyze the most suitable RA method among PAMA, DAMA, and RA classified by the multiple access method of satellite communication in the rapidly changing traffic environment according to the emergency and tactical situation. It suggests an alternative to improve the limit of output degradation. Based on the CRDSA protocol selected as the standard of DVB-RCS2 among the current satellite communication methods, CRDSA2R (Contention) maintains an optimal RA channel environment by checking the limitations in an environment where packet volume is rapidly increasing and observing channel load and channel conditions. We propose a Resolution Diversity Slotted ALOHA with Adaptive Random Access.

JMP+RAND: Mitigating Memory Sharing-Based Side-Channel Attack by Embedding Random Values in Binaries (JMP+RAND: 바이너리 난수 삽입을 통한 메모리 공유 기반 부채널 공격 방어 기법)

  • Kim, Taehun;Shin, Youngjoo
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.5
    • /
    • pp.101-106
    • /
    • 2020
  • Since computer became available, much effort has been made to achieve information security. Even though memory protection defense mechanisms were studied the most among of them, the problems of existing memory protection defense mechanisms were found due to improved performance of computer and new defense mechanisms were needed due to the advent of the side-channel attacks. In this paper, we propose JMP+RAND that embedding random values of 5 to 8 bytes per page to defend against memory sharing based side-channel attacks and bridging the gap of existing memory protection defense mechanism. Unlike the defense mechanism of the existing side-channel attacks, JMP+RAND uses static binary rewriting and continuous jmp instruction and random values to defend against the side-channel attacks in advance. We numerically calculated the time it takes for a memory sharing-based side-channel attack to binary adopted JMP+RAND technique and verified that the attacks are impossible in a realistic time. Modern architectures have very low overhead for JMP+RAND because of the very fast and accurate branching of jmp instruction using branch prediction. Since random value can be embedded only in specific programs using JMP+RAND, it is expected to be highly efficient when used with memory deduplication technique, especially in a cloud computing environment.

Robust Speaker Identification using Independent Component Analysis (독립성분 분석을 이용한 강인한 화자식별)

  • Jang, Gil-Jin;Oh, Yung-Hwan
    • Journal of KIISE:Software and Applications
    • /
    • v.27 no.5
    • /
    • pp.583-592
    • /
    • 2000
  • This paper proposes feature parameter transformation method using independent component analysis (ICA) for speaker identification. The proposed method assumes that the cepstral vectors from various channel-conditioned speech are constructed by a linear combination of some characteristic functions with random channel noise added, and transforms them into new vectors using ICA. The resultant vector space can give emphasis to the repetitive speaker information and suppress the random channel distortions. Experimental results show that the transformation method is effective for the improvement of speaker identification system.

  • PDF

A New Low-BMR Quantization Method for Wireless Channel Characteristics-based Secret Key Generation

  • Wang, Qiuhua;Lyu, Qiuyun;Wang, Xiaojun;BAO, Jianrong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.5080-5097
    • /
    • 2017
  • Channel characteristics-based secret key generation is an effective physical-layer security method. The issues of how to remove the effect of random noise and to balance the key generation rate (KGR) and the bit mismatch rate (BMR) are needed to be addressed. In this paper, to reduce the effect of random noise and extract more secret bits, a new quantization scheme with high key generation rate and low bit mismatch rate is proposed. In our proposed scheme, we try to use all measurements and correct the differences caused by noise at the boundary regions instead of simply dropping them. We evaluate and discuss the improvements of our proposed scheme. The results show that our proposed scheme achieves lower bit mismatch rate as well as remaining high key generation rate.