Soc format Ron Muellerschoen Jet Propulsion Laboratory California Institute of Technology.

Slides:



Advertisements
Similar presentations
Introduction to MS-Aloha R. Scopigno, Networking Lab – 1.
Advertisements

Synchronization in Broadcasting ~various components of a coded service in broadcasting need to maintain synchronization and a fixed end-to-end delay between.
Line Balancing Problem A B C 4.1mins D 1.7mins E 2.7 mins F 3.3 mins G 2.6 mins 2.2 mins 3.4 mins.
Future Directions For IP Architectures Ipv6 Cs686 Sadik Gokhan Caglar.
1 IPv6. 2 Problem: 32-bit address space will be completely allocated by Solution: Design a new IP with a larger address space, called the IP version.
Umut Girit  One of the core members of the Internet Protocol Suite, the set of network protocols used for the Internet. With UDP, computer.
Laboratório de Teleprocessamento e Redes1 Unix Network Programming Prof. Nelson Fonseca
Introduction1-1 message segment datagram frame source application transport network link physical HtHt HnHn HlHl M HtHt HnHn M HtHt M M destination application.
BZUPAGES.COM 1 User Datagram Protocol - UDP RFC 768, Protocol 17 Provides unreliable, connectionless on top of IP Minimal overhead, high performance –No.
ISO/OSI Model Layers Application: applications that use the network. This is were mail, browsers, ftp, etc reside Presentation: data formats, character.
Solar Disturbance of GPS Satellite Orbits Merita Halili Orhan Veliu 06 june 2008.
1 Solutions to Performance Problems in VOIP over Wireless LAN Wei Wang, Soung C. Liew Presented By Syed Zaidi.
Lesson 7 – THE BUSINESS OF NETWORKING. TCP/IP and UDP Other Internet protocols Important Internet protocols OVERVIEW.
A SINGLE FREQUENCY GPS SOFTWARE RECEIVER
Introduction to TCP/IP
1 Application TCPUDP IPICMPARPRARP Physical network Application TCP/IP Protocol Suite.
SDF: Stanford Data Format Zak Sahul, Oscar Carrillo, Jed Black Stanford University.
Gursharan Singh Tatla Transport Layer 16-May
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking Ethernet, ARP.
1 Chapter Overview IP (v4) Address IPv6. 2 IPv4 Addresses Internet Protocol (IP) is the only network layer protocol with its own addressing system and.
Data Types in the Kernel Sarah Diesburg COP 5641.
TRANSPORT LAYER T.Najah Al-Subaie Kingdom of Saudi Arabia Prince Norah bint Abdul Rahman University College of Computer Since and Information System NET331.
University of Calgary – CPSC 441.  UDP stands for User Datagram Protocol.  A protocol for the Transport Layer in the protocol Stack.  Alternative to.
MCRDS Data Format May 3, File Type Header Data file type –32 byte string (“Data-MCRDS”) terminated with null character ‘\0’. Characters after termination.
Computer Networks: Multimedia Applications Ivan Marsic Rutgers University Chapter 3 – Multimedia & Real-time Applications.
LWIP TCP/IP Stack 김백규.
Seismic Networks Operated by Central Weather Bureau in Taiwan Ta-Yi Chen Central Weather Bureau.
Chapter Three Network Protocols By JD McGuire ARP Address Resolution Protocol Address Resolution Protocol The core protocol in the TCP/IP suite that.
TCP : Transmission Control Protocol Computer Network System Sirak Kaewjamnong.
Protocols 1 Objective: Build a protocol foundation for Client / Server programming in an Internet Environment Note: RFCs available from
Datagram Congestion Control Protocol
Internetworking Internet: A network among networks, or a network of networks Allows accommodation of multiple network technologies Universal Service Routers.
GRIM & DynaPos Overview, Examples and Results Dr. Benjamin Remondi Kendall The XYZs' of GPS,
Features of the new Alibava firmware: 1. Universal for laboratory use (readout of stand-alone detector via USB interface) and for the telescope readout.
Internet Protocol Formats. IP (V4) Packet byte 0 byte1 byte 2 byte 3 data... – up to 65 K including heading info Version IHL Serv. Type Total Length Identifcation.
NS Training Hardware. Print Engine Controller NS9775.
Speaker: Yi-Lei Chang Advisor: Dr. Kai-Wei Ke 2012/05/15 IPv6-based wireless sensor network 1.
1 Internetworking: IP Packet Switching Reading: (except Implementation; pp )
Wireless Networks: Physical and Link Layers Wired Typically point-to- point connections Interference effects are not significant Not power constrained.
1 Kyung Hee University Chapter 11 User Datagram Protocol.
Doc.: IEEE /0370r0 Submission January 2012 Haiguang Wang et. al, I2R, SingaporeSlide 1 TIM Compression Date: Authors:
Doc.: IEEE /250r0 Submission, Slide 1 Project: IEEE P Working Group for Wireless Personal Area Networks (WPANs) Submission Title: IEEE :
Doc.:IEEE /0129r1 January 2012 S.Abraham, Qualcomm Inc Short Beacon Slide 1 Authors:
National Aeronautics and Space Administration Jet Propulsion Laboratory, California Institute of Technology Bundle Protocol Status Scott Burleigh Jet Propulsion.
DCN286 Introduction to Data Communication Technology Session 11.
1 Layer 3: Routing & Addressing Honolulu Community College Cisco Academy Training Center Semester 1 Version
Chapter 11 User Datagram Protocol
The Transport Layer Congestion Control & UDP
Big-Endians Little-Endians and Bi-Endians
588 Section 3 Neil Spring April 20, 1999.
Standards Basics.
TCP Transport layer Er. Vikram Dhiman LPU.
Transport Layer Our goals:
Chapter 14 User Datagram Protocol (UDP)
Internetworking Outline Best Effort Service Model
Process-to-Process Delivery:
IS 4506 Server Configuration (HTTP Server)
Track Output Interpretation
Little Endian vs. Big Endian (Intel vs. Motorola)
IP - The Internet Protocol
Protocol layering and data
TCP/IP Protocol Suite: Review
The University of Adelaide, School of Computer Science
CS4470 Computer Networking Protocols
Track Output Interpretation
Protocol layering and data
Process-to-Process Delivery: UDP, TCP
16EC Computer networks unit II Mr.M.Jagadesh
doc.: IEEE < IETF>
Transport Layer 9/22/2019.
Presentation transcript:

soc format Ron Muellerschoen Jet Propulsion Laboratory California Institute of Technology

background Designed to transport 1 Hz GPS data with minimal bandwidth over the Open Internet, July 1999 –“soc” from socket, which is the interface at the application layer –format stable since January, 2000 (when SNR numbers added) –follows little-endian byte order (PC order) Transport layer is UDP, so format does not include: –sync bits –checksum or CRC Efficient compression of 5 GPS observable (CA, P1, P2, L1,L2) down to 14 bytes and a nibble –1 mm range resolution –.02 mm phase resolution Total size per station per 1 Hz epoch: –17+21*n_GPS bytes

soc attributes contains edit flags (or epochs) for cycle slips stand alone time-tag per epoch minimum representation of receiver’s clock solution 3 SNR numbers unique site id modulo 12 hour sequence number flags: –receiver type –GPS health flag simple structure –8 byte header –9 byte overhead ( timetag, number of gps, etc. ) –21 data bytes per gps

soc format header (8 bytes) –unsigned short typemax value 2^16 -1 type 0 - request for replay of packet, to remote site type 1 - receiver data, from remote site type 3 - broadcast ephemeris, from remote site type 4 - heartbeat, among data collectors type 5 - “will”, among data collectors –unsigned short lengthmax value –unsigned short seqnummax value ( 12 hours ) –unsigned short site idmax value 65535

type 1 - receiver data overhead ( 9 bytes ) –unsigned int gps_minutes4 bytes minutes past 6-jan-1980, good until year –unsigned short gps_millisecs2 bytes good for seconds –short navt2 bytes units of 10*meters range +/-327,680 meters –unsigned char sats_and_status1 byte bits 7-4 indicates number of sats less 1 (max of 16) bits 1-3 indicate receiver type ( max of 7 ) bit 0 reserved for health status

type 1 - receiver data data bytes ( 21 per gps ) –unsigned char prn 0 to 2551 byte –unsigned short epoch_seq 0 to bytes 10 hour non-ambiguous phase epoch –char ca_range[5]5 bytes highest 4 bits of first memory location are status bits next 36 bits contain the ca_range in mm. –most significant bytes are now in lowest memory location »highest bits of byte are most significant »think big-endian order 2^36 -1 possible values, min 0, max 68, kms –unsigned char snr (for ca_range)0 to 2551 byte –L2_block6 bytes –L1_block6 bytes

L1 & L2 block: overview L1 and L2 block ( 6 bytes each ) –first 2 bytes and 2 bits for range range units in mms 2*(2^17 - 1) possible values dynamic range <= meters –next 6 bits and 2 bytes for phase Phase units in 0.02 mms 2*(2^21- 1) possible values dynamic range <= meters –extended w/ overflow bits to meters –last byte unsigned char snr0 to 255

L1 & L2 block: compression Align L2/L1 to within integer wavelength of P2/P1 w/ editor L2_block first: range_2 = P2 - CA_range Like: R I - (R I) ~ I <= m. phase_2 = L2 - CA_range *range_2 Like: R I - (R I) I ~ 0 <= m. L1_block second: range_1 = P1 - CA_range Like: R I - (R I) ~ 0 (ca-p code bias) <= m. phase_1 = L1 - CA_range *range_2 Like: R I - (R I) I ~ 0 <= m.

L1 & L2 block: initial point Align L1 to integer wavelength of P1 w/ data editor N_L1 = floor( (P1 - L1) / ) at start of phase arc L1 += N_L1 * for a phase connected arc But P1-L1 ~ R I - ( R I + L1_phase_bias ) ~ 3.09 I - L1_phase_bias Must subtract also from N_L1: N_L1 -= floor(3.09*(P2-P1)/ ) Likewise for L2 N_L2 = floor( (P2 - L2) / ) at start of phase arc L2 += N_L2 * for a phase connected arc But P2-L2 ~ R I - ( R I + L2_phase_bias ) ~ 5.09 I - L2_phase_bias Must subtract also from N_L2: N_L2 -= floor(5.09*(P2-P1)/ )

/* If phase break, then re-adjust the cycle count of the phase to align closer to the range. */ if ( (ll[0] == 1) || (ll[1] == 1) || force_break[SiteIDm1][prnj] ) { adjustct[SiteIDm1][0][prnj] = ((p1 - l1*LAML1) / LAML1) + 0.5; adjustct[SiteIDm1][1][prnj] = ((p2 - l2*LAML2) / LAML2) + 0.5; adjustct[SiteIDm1][0][prnj] = floor( adjustct[SiteIDm1][0][prnj] ); adjustct[SiteIDm1][1][prnj] = floor( adjustct[SiteIDm1][1][prnj] ); ll[0] = 1; ll[1] = 1; force_break[SiteIDm1][prnj] = false; /* further adjust for dynamic range, want only bias portion */ if ( send_to_socket ) { first_iono = p2 - p1; /* all in units of meters */ l1_adjust = floor( ALPHA1*first_iono/LAML1 +.5 ); l2_adjust = floor( ALPHA2*first_iono/LAML2 +.5 ); adjustct[SiteIDm1][0][prnj] -= l1_adjust; adjustct[SiteIDm1][1][prnj] -= l2_adjust; } /* Add integer cycles to L1 and L2 to align closer to the range. */ l1 += adjustct[SiteIDm1][0][prnj]; l2 += adjustct[SiteIDm1][1][prnj]; initial point, for example