Skip to main content

Airtel 4G services


Airtel's 4G (TD-LTE) network was launched by telecoms minister Kapil Sibal.
 Telecom major Bharti Airtel on Tuesday said that  it will be ready to launch 4g services to the
people in banglore in the next 30 days. 
The company today announced launch of fourth generation (4G) telecom service using TD-LTE technology in Kolkata. It has selected Chinese telecom equipment company ZTE for providing technology and equipments for the service. 
      The company has not got approval to provide voice and sms service to users on 4G network.
compared to the existing 3g services that allow download speed up to 21 mbps(mega byte per second) 4G allows a download limit up to 100 mbps(almost 5 times higher than 3g).
The company has announced 2 different USB dongles for accessing 4G service priced at Rs 7,750 and Rs 7,999 and three data plans ranging between Rs 999 and Rs 1,999.
Currently, Airtel’s 4G pricing in Kolkata starts at Rs 999 with a usage of 6GB.
The company had won BWA spectrum in 2010 for four telecom circles -- Kolkata, Maharashtra, Punjab and Karnataka and had paid Rs 3,314.36 crore.
The company was allocated 20 Mhz of BWA spectrum in 2.3 Ghz frequency band which is considered suitable for transmitting signals for operating 4G services.
The lesser priced device is meant for indoor access of the service while the higher priced dongle is for using broadband on the move. 
Current situation:
airtel should improves der 2G service in mumbai, pune mostly in cities bfore starting 4g jinse 2G sambhala nahi ja raha woh 4G kya sambhalenge-kiran patil -mumbai

source: http://www.thehindubusinessline.com/

Comments

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime