📄 modulation.cc
字号:
/* -*- Mode:C++; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- *//* * Copyright (c) 1997 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the Computer Systems * Engineering Group at Lawrence Berkeley Laboratory. * 4. Neither the name of the University nor of the Laboratory may be used * to endorse or promote products derived from this software without * specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. *//* Ported from CMU/Monarch's code, nov'98 -Padma.*/#include <math.h>#include <stdlib.h>#include <random.h>//#include <debug.h>#include <modulation.h>#include <iostream>using namespace std;intModulation::command(int argc, const char*const* argv){ TclObject *obj; if(argc == 3) { if( (obj = TclObject::lookup(argv[2])) == 0) { fprintf(stderr, "Modulation: %s lookup of %s failed\n", argv[1], argv[2]); return TCL_ERROR; } } return TclObject::command(argc,argv);}/* ====================================================================== Binary Phase Shift Keying ====================================================================== */// begin RPI FSO Extensions// methods for free space modelstatic class BPSKClass: public TclClass {public: BPSKClass() : TclClass("Modulation/BPSK") {} TclObject* create(int, const char*const*) { return (new BPSK); }} class_bpsk; // RPI - taken out because it just sets it to zero!/*BPSK::BPSK(){ Rs = 0;}BPSK::BPSK(int S){ Rs = S;}*/// end RPI FSO ExtensionsintBPSK::BitError(double Pr, int Size){ double Pe; // probability of error double x; int nbit = 0; // number of bit errors tolerated if(nbit == 0) { Pe = ProbBitError(Pr); } else { Pe = ProbBitError(Pr, nbit); } // quick check if(Pe == 0.0) return 0; // no bit errors // begin RPI FSO Extensions // scale the error probabilty // Pe *= 1e3; // scale the probably by the number of bits in the packet. Pe *= Size * 4; RandomNumberGenerator_.set_seed(0.0l); x = RandomNumberGenerator_.uniform(0.0l,1.0l); // x = (double)(((int)Random::uniform()) % 1000); // end RPI FSO Extensions if(x < Pe) return 1; // bit error else return 0; // no bit errors}doubleBPSK::ProbBitError(double Pr){ // begin RPI FSO Extensions double Noise = 0.0001; // AWGN (Watts) double SNR = Pr/Noise; if(SNR < 1.0) { return 1.0; } double SNRdB = 4.342944819 * log(SNR); // 10 * ln(SNR)/ln(10) double x = sqrt(SNRdB); double Qx = 1/(x*2.506628275) * exp(-((x*x)/2)); return Qx; // end RPI FSO Extensions}doubleBPSK::ProbBitError(double Pr, int n){ double Pe = 0.0; return Pe;}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -