Search - max - CodeBus

Search - max - List

[Communication-Mobile] WiMAX-Capacity_3 DL : 0: Wi-max capacity, have many information about how to calculate the capacity of wimax
Date : 2025-12-28 Size : 629kb User : jon
[Communication-Mobile] WiMAX_Security DL : 0: its discussed about WI-max security,problem and different related information about this topic. -its discussed about WI-max security,problem and different related information about this topic.
Date : 2025-12-28 Size : 32kb User : testimony
[Communication-Mobile] vij1 DL : 0: function ber_ml=Alamoudi(snr,soglia) This function simulates a Alamouti scheme. The input variables are soglia and snr. Soglia: is the number of errors after which the iterations stop. For better results, put high value of soglia, but the simulation is longer. snr: the signal to noise ratio (if u don t know what is a signal to noise ratio, well, come back to your high school!). Note: U should use this function with a main function in wich u chose different value of snr. That s because this function work just with one value of snr. If u have problem with this code, write me at m.allegritti@email.it. Take care! Max
Date : 2025-12-28 Size : 1kb User : dasu
[Communication-Mobile] ldpcc_MaxLogSPA_dec_on_gfq DL : 0: max log SPA decoder for non binary ldpc decoder
Date : 2025-12-28 Size : 329kb User : kangdonghyub
[Communication-Mobile] findoptt DL : 0: function optt = findoptt(L,C,pmax,rP,a,w,maxw) Arguments: L =input( links in the network ) C =input( coordinates of nodes ) pmax =input( max. transmission power ) rP - see rndtopo2d a - fading coefficient (a<-2) Output: optt(i) - optimal blocking distance around destination of L(i), i.e. radius of the circle in which there should be no active nodes when L(i) is active. Description: We try to estimate the optimal blocking distance for the source of each link. For every node we start with a candidate distance t. We then estimate a number of slots N needed for the network as a number of link sources in that circle. We also est- function optt = findoptt(L,C,pmax,rP,a,w,maxw) Arguments: L =input( links in the network ) C =input( coordinates of nodes ) pmax =input( max. transmission power ) rP - see rndtopo2d a - fading coefficient (a<-2) Output: optt(i) - optimal blocking distance around destination of L(i), i.e. radius of the circle in which there should be no active nodes when L(i) is active. Description: We try to estimate the optimal blocking distance for the source of each link. For every node we start with a candidate distance t. We then estimate a number of slots N needed for the network as a number of link sources in that circle. We also est
Date : 2025-12-28 Size : 1kb User : Hemanth
[Communication-Mobile] turbo DL : 0: turbo码的map,log-map以及max-log-map的算法的c程序仿真-turbo code of the map, log-map and the max-log-map algorithm for c program simulation
Date : 2025-12-28 Size : 5kb User : 章剑